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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-CTLCardinality-00
FORMULA_NAME Peterson-PT-4-CTLCardinality-01
FORMULA_NAME Peterson-PT-4-CTLCardinality-02
FORMULA_NAME Peterson-PT-4-CTLCardinality-03
FORMULA_NAME Peterson-PT-4-CTLCardinality-04
FORMULA_NAME Peterson-PT-4-CTLCardinality-05
FORMULA_NAME Peterson-PT-4-CTLCardinality-06
FORMULA_NAME Peterson-PT-4-CTLCardinality-07
FORMULA_NAME Peterson-PT-4-CTLCardinality-08
FORMULA_NAME Peterson-PT-4-CTLCardinality-09
FORMULA_NAME Peterson-PT-4-CTLCardinality-10
FORMULA_NAME Peterson-PT-4-CTLCardinality-11
FORMULA_NAME Peterson-PT-4-CTLCardinality-12
FORMULA_NAME Peterson-PT-4-CTLCardinality-13
FORMULA_NAME Peterson-PT-4-CTLCardinality-14
FORMULA_NAME Peterson-PT-4-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679132912552

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:48:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 09:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:48:36] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-03-18 09:48:36] [INFO ] Transformed 480 places.
[2023-03-18 09:48:36] [INFO ] Transformed 690 transitions.
[2023-03-18 09:48:36] [INFO ] Found NUPN structural information;
[2023-03-18 09:48:36] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-18 09:48:36] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 66 ms.
FORMULA Peterson-PT-4-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 456 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 52 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 09:48:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 09:48:37] [INFO ] Computed 19 place invariants in 29 ms
[2023-03-18 09:48:37] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-18 09:48:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 09:48:37] [INFO ] Invariant cache hit.
[2023-03-18 09:48:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:48:38] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2023-03-18 09:48:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 09:48:38] [INFO ] Invariant cache hit.
[2023-03-18 09:48:39] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2782 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 456 out of 480 places after structural reductions.
[2023-03-18 09:48:40] [INFO ] Flatten gal took : 150 ms
[2023-03-18 09:48:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 09:48:40] [INFO ] Flatten gal took : 78 ms
[2023-03-18 09:48:40] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 454 out of 480 places (down from 456) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1177 ms. (steps per millisecond=8 ) properties (out of 53) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-18 09:48:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 09:48:42] [INFO ] Invariant cache hit.
[2023-03-18 09:48:43] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2023-03-18 09:48:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2023-03-18 09:48:43] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :13 sat :0 real:19
[2023-03-18 09:48:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-18 09:48:44] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 17 ms returned sat
[2023-03-18 09:48:45] [INFO ] After 920ms SMT Verify possible using state equation in natural domain returned unsat :19 sat :13
[2023-03-18 09:48:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:48:45] [INFO ] After 677ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :19 sat :13
[2023-03-18 09:48:46] [INFO ] Deduced a trap composed of 44 places in 435 ms of which 15 ms to minimize.
[2023-03-18 09:48:46] [INFO ] Deduced a trap composed of 10 places in 468 ms of which 2 ms to minimize.
[2023-03-18 09:48:47] [INFO ] Deduced a trap composed of 18 places in 355 ms of which 3 ms to minimize.
[2023-03-18 09:48:47] [INFO ] Deduced a trap composed of 10 places in 440 ms of which 3 ms to minimize.
[2023-03-18 09:48:48] [INFO ] Deduced a trap composed of 17 places in 433 ms of which 2 ms to minimize.
[2023-03-18 09:48:48] [INFO ] Deduced a trap composed of 54 places in 384 ms of which 2 ms to minimize.
[2023-03-18 09:48:49] [INFO ] Deduced a trap composed of 54 places in 378 ms of which 1 ms to minimize.
[2023-03-18 09:48:49] [INFO ] Deduced a trap composed of 54 places in 405 ms of which 2 ms to minimize.
[2023-03-18 09:48:49] [INFO ] Deduced a trap composed of 54 places in 346 ms of which 1 ms to minimize.
[2023-03-18 09:48:50] [INFO ] Deduced a trap composed of 21 places in 397 ms of which 2 ms to minimize.
[2023-03-18 09:48:50] [INFO ] Deduced a trap composed of 76 places in 273 ms of which 2 ms to minimize.
[2023-03-18 09:48:51] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 1 ms to minimize.
[2023-03-18 09:48:51] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 0 ms to minimize.
[2023-03-18 09:48:51] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 1 ms to minimize.
[2023-03-18 09:48:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5534 ms
[2023-03-18 09:48:51] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 2 ms to minimize.
[2023-03-18 09:48:51] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 1 ms to minimize.
[2023-03-18 09:48:52] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 1 ms to minimize.
[2023-03-18 09:48:52] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 2 ms to minimize.
[2023-03-18 09:48:52] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 1 ms to minimize.
[2023-03-18 09:48:53] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 1 ms to minimize.
[2023-03-18 09:48:53] [INFO ] Deduced a trap composed of 50 places in 265 ms of which 1 ms to minimize.
[2023-03-18 09:48:53] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 2 ms to minimize.
[2023-03-18 09:48:53] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 1 ms to minimize.
[2023-03-18 09:48:54] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 3 ms to minimize.
[2023-03-18 09:48:54] [INFO ] Deduced a trap composed of 96 places in 301 ms of which 1 ms to minimize.
[2023-03-18 09:48:54] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 1 ms to minimize.
[2023-03-18 09:48:54] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-18 09:48:55] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 2 ms to minimize.
[2023-03-18 09:48:55] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 1 ms to minimize.
[2023-03-18 09:48:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4029 ms
[2023-03-18 09:48:55] [INFO ] Deduced a trap composed of 10 places in 386 ms of which 1 ms to minimize.
[2023-03-18 09:48:56] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 1 ms to minimize.
[2023-03-18 09:48:56] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 1 ms to minimize.
[2023-03-18 09:48:57] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 2 ms to minimize.
[2023-03-18 09:48:57] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 2 ms to minimize.
[2023-03-18 09:48:57] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 2 ms to minimize.
[2023-03-18 09:48:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2054 ms
[2023-03-18 09:48:58] [INFO ] Deduced a trap composed of 14 places in 370 ms of which 1 ms to minimize.
[2023-03-18 09:48:58] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 1 ms to minimize.
[2023-03-18 09:48:58] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 1 ms to minimize.
[2023-03-18 09:48:59] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2023-03-18 09:48:59] [INFO ] Deduced a trap composed of 87 places in 265 ms of which 2 ms to minimize.
[2023-03-18 09:49:00] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 1 ms to minimize.
[2023-03-18 09:49:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2334 ms
[2023-03-18 09:49:00] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2023-03-18 09:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-18 09:49:01] [INFO ] Deduced a trap composed of 104 places in 347 ms of which 1 ms to minimize.
[2023-03-18 09:49:01] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 1 ms to minimize.
[2023-03-18 09:49:02] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 1 ms to minimize.
[2023-03-18 09:49:02] [INFO ] Deduced a trap composed of 44 places in 330 ms of which 1 ms to minimize.
[2023-03-18 09:49:02] [INFO ] Deduced a trap composed of 32 places in 317 ms of which 0 ms to minimize.
[2023-03-18 09:49:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1940 ms
[2023-03-18 09:49:03] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 1 ms to minimize.
[2023-03-18 09:49:03] [INFO ] Deduced a trap composed of 38 places in 341 ms of which 1 ms to minimize.
[2023-03-18 09:49:04] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 1 ms to minimize.
[2023-03-18 09:49:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1224 ms
[2023-03-18 09:49:04] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 2 ms to minimize.
[2023-03-18 09:49:04] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 1 ms to minimize.
[2023-03-18 09:49:04] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 1 ms to minimize.
[2023-03-18 09:49:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 931 ms
[2023-03-18 09:49:05] [INFO ] Deduced a trap composed of 85 places in 235 ms of which 1 ms to minimize.
[2023-03-18 09:49:05] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 1 ms to minimize.
[2023-03-18 09:49:05] [INFO ] Deduced a trap composed of 83 places in 230 ms of which 1 ms to minimize.
[2023-03-18 09:49:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 865 ms
[2023-03-18 09:49:06] [INFO ] After 20874ms SMT Verify possible using trap constraints in natural domain returned unsat :19 sat :13
Attempting to minimize the solution found.
Minimization took 1036 ms.
[2023-03-18 09:49:07] [INFO ] After 23663ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :13
Fused 32 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 480 transition count 514
Reduce places removed 176 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 183 rules applied. Total rules applied 359 place count 304 transition count 507
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 366 place count 297 transition count 507
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 366 place count 297 transition count 412
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 556 place count 202 transition count 412
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 130 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 184/480 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-18 09:49:08] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 184 cols
[2023-03-18 09:49:08] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 09:49:08] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-18 09:49:08] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-18 09:49:08] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 09:49:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:49:08] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:49:09] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:09] [INFO ] After 262ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:09] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-18 09:49:09] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2023-03-18 09:49:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 699 ms
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 2 ms to minimize.
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2389 ms
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 4 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 424 ms
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1944 ms
[2023-03-18 09:49:16] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-18 09:49:16] [INFO ] After 7170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-18 09:49:16] [INFO ] After 8054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 176 ms.
Support contains 17 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 394/394 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 184 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 183 transition count 393
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 183 transition count 391
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 181 transition count 391
Applied a total of 6 rules in 46 ms. Remains 181 /184 variables (removed 3) and now considering 391/394 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 181/184 places, 391/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 517356 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517356 steps, saw 86609 distinct states, run finished after 3003 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 09:49:20] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
// Phase 1: matrix 331 rows 181 cols
[2023-03-18 09:49:21] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-18 09:49:21] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:49:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:49:21] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 09:49:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 09:49:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 09:49:21] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:22] [INFO ] After 242ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:22] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2023-03-18 09:49:22] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2023-03-18 09:49:22] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-18 09:49:22] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-18 09:49:22] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 0 ms to minimize.
[2023-03-18 09:49:23] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2023-03-18 09:49:23] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-18 09:49:23] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-18 09:49:23] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-18 09:49:23] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-18 09:49:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1567 ms
[2023-03-18 09:49:23] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 854 ms
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-18 09:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2023-03-18 09:49:25] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1159 ms
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2023-03-18 09:49:26] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 598 ms
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 891 ms
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 713 ms
[2023-03-18 09:49:29] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2023-03-18 09:49:29] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-18 09:49:29] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-18 09:49:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2023-03-18 09:49:29] [INFO ] After 7441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 368 ms.
[2023-03-18 09:49:29] [INFO ] After 8307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 128 ms.
Support contains 17 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 391/391 transitions.
Applied a total of 0 rules in 23 ms. Remains 181 /181 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 181/181 places, 391/391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 391/391 transitions.
Applied a total of 0 rules in 22 ms. Remains 181 /181 variables (removed 0) and now considering 391/391 (removed 0) transitions.
[2023-03-18 09:49:29] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
[2023-03-18 09:49:29] [INFO ] Invariant cache hit.
[2023-03-18 09:49:30] [INFO ] Implicit Places using invariants in 378 ms returned [171, 172, 173, 174, 175]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 382 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 176/181 places, 391/391 transitions.
Applied a total of 0 rules in 22 ms. Remains 176 /176 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 428 ms. Remains : 176/181 places, 391/391 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 499560 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499560 steps, saw 83661 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 09:49:34] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
// Phase 1: matrix 331 rows 176 cols
[2023-03-18 09:49:34] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 09:49:34] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:49:34] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 09:49:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 09:49:35] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:35] [INFO ] After 248ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:35] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-18 09:49:35] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-18 09:49:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 0 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1906 ms
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 601 ms
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 314 ms
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 622 ms
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 376 ms
[2023-03-18 09:49:40] [INFO ] After 4728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 286 ms.
[2023-03-18 09:49:40] [INFO ] After 5598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 193 ms.
Support contains 17 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 391/391 transitions.
Applied a total of 0 rules in 25 ms. Remains 176 /176 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 176/176 places, 391/391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 391/391 transitions.
Applied a total of 0 rules in 17 ms. Remains 176 /176 variables (removed 0) and now considering 391/391 (removed 0) transitions.
[2023-03-18 09:49:40] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
[2023-03-18 09:49:40] [INFO ] Invariant cache hit.
[2023-03-18 09:49:40] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-18 09:49:40] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
[2023-03-18 09:49:40] [INFO ] Invariant cache hit.
[2023-03-18 09:49:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:41] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2023-03-18 09:49:41] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 09:49:41] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
[2023-03-18 09:49:41] [INFO ] Invariant cache hit.
[2023-03-18 09:49:42] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1598 ms. Remains : 176/176 places, 391/391 transitions.
Graph (trivial) has 261 edges and 176 vertex of which 80 / 176 are part of one of the 18 SCC in 5 ms
Free SCC test removed 62 places
Drop transitions removed 124 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 195 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 114 transition count 185
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 103 transition count 185
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 92 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 92 transition count 167
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 67 place count 80 transition count 188
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 33 edges and 80 vertex of which 10 / 80 are part of one of the 2 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 73 place count 72 transition count 183
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 84 place count 71 transition count 173
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 86 place count 70 transition count 172
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 100 place count 70 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 70 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 69 transition count 157
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 105 place count 69 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 66 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 116 place count 66 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 66 transition count 153
Applied a total of 117 rules in 73 ms. Remains 66 /176 variables (removed 110) and now considering 153/391 (removed 238) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 153 rows 66 cols
[2023-03-18 09:49:42] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-18 09:49:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-18 09:49:42] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 09:49:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-18 09:49:42] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 09:49:43] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-18 09:49:43] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Successfully simplified 19 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 09:49:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 66 ms
[2023-03-18 09:49:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-PT-4-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 60 ms
[2023-03-18 09:49:43] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 168 out of 480 places (down from 185) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 52 ms
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 65 ms
[2023-03-18 09:49:43] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 42 ms
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 42 ms
[2023-03-18 09:49:43] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 39 ms
[2023-03-18 09:49:43] [INFO ] Flatten gal took : 40 ms
[2023-03-18 09:49:43] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 33 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 32 ms
[2023-03-18 09:49:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 480 transition count 500
Reduce places removed 190 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 195 rules applied. Total rules applied 385 place count 290 transition count 495
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 390 place count 285 transition count 495
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 390 place count 285 transition count 399
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 582 place count 189 transition count 399
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 622 place count 169 transition count 379
Applied a total of 622 rules in 51 ms. Remains 169 /480 variables (removed 311) and now considering 379/690 (removed 311) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 169/480 places, 379/690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 16 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:49:44] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 33 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 29 ms
[2023-03-18 09:49:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 26 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 26 ms
[2023-03-18 09:49:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 25 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 27 ms
[2023-03-18 09:49:44] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 25 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 25 ms
[2023-03-18 09:49:44] [INFO ] Input system was already deterministic with 690 transitions.
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 26 ms
[2023-03-18 09:49:44] [INFO ] Flatten gal took : 27 ms
[2023-03-18 09:49:44] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-18 09:49:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 7 ms.
Total runtime 68593 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/1090/ctl_0_ --ctl=/tmp/1090/ctl_1_ --ctl=/tmp/1090/ctl_2_ --ctl=/tmp/1090/ctl_3_ --ctl=/tmp/1090/ctl_4_ --ctl=/tmp/1090/ctl_5_ --ctl=/tmp/1090/ctl_6_ --ctl=/tmp/1090/ctl_7_ --ctl=/tmp/1090/ctl_8_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15202704 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094220 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="Peterson-PT-4"
export BK_EXAMINATION="CTLCardinality"
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 Peterson-PT-4, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540300617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;