Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695700394.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BugTracking-PT-q8m004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678719691778

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 15:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 15:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:01:33] [INFO ] Load time of PNML (sax parser for PT used): 588 ms
[2023-03-13 15:01:33] [INFO ] Transformed 754 places.
[2023-03-13 15:01:33] [INFO ] Transformed 27370 transitions.
[2023-03-13 15:01:33] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 750 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 474 places in 95 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m004-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 91 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-13 15:01:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-13 15:01:34] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-13 15:01:34] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-13 15:01:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 15:01:34] [INFO ] Invariant cache hit.
[2023-03-13 15:01:35] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 15:01:37] [INFO ] Implicit Places using invariants and state equation in 2704 ms returned []
Implicit Place search using SMT with State Equation took 3348 ms to find 0 implicit places.
[2023-03-13 15:01:37] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 15:01:37] [INFO ] Invariant cache hit.
[2023-03-13 15:01:38] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4589 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 24 out of 277 places after structural reductions.
[2023-03-13 15:01:39] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 15:01:39] [INFO ] Flatten gal took : 311 ms
FORMULA BugTracking-PT-q8m004-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:01:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m004-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:01:39] [INFO ] Flatten gal took : 179 ms
[2023-03-13 15:01:39] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 17 out of 277 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 106784 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106784 steps, saw 60734 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-13 15:01:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 15:01:43] [INFO ] Invariant cache hit.
[2023-03-13 15:01:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:01:45] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-13 15:01:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:01:46] [INFO ] After 1120ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-13 15:01:46] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 15:01:47] [INFO ] After 820ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-13 15:01:47] [INFO ] Deduced a trap composed of 17 places in 483 ms of which 3 ms to minimize.
[2023-03-13 15:01:48] [INFO ] Deduced a trap composed of 22 places in 478 ms of which 1 ms to minimize.
[2023-03-13 15:01:48] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 1 ms to minimize.
[2023-03-13 15:01:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1619 ms
[2023-03-13 15:01:49] [INFO ] Deduced a trap composed of 51 places in 405 ms of which 2 ms to minimize.
[2023-03-13 15:01:50] [INFO ] Deduced a trap composed of 32 places in 472 ms of which 1 ms to minimize.
[2023-03-13 15:01:50] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 0 ms to minimize.
[2023-03-13 15:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1609 ms
[2023-03-13 15:01:51] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 1 ms to minimize.
[2023-03-13 15:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2023-03-13 15:01:51] [INFO ] Deduced a trap composed of 74 places in 314 ms of which 2 ms to minimize.
[2023-03-13 15:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2023-03-13 15:01:51] [INFO ] After 5437ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-13 15:01:52] [INFO ] After 7024ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 305 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 114657 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114657 steps, saw 75545 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 15:01:55] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-13 15:01:55] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-13 15:01:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:01:56] [INFO ] After 898ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 15:01:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:01:57] [INFO ] After 545ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:01:57] [INFO ] After 1557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:01:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:01:58] [INFO ] After 810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:01:58] [INFO ] After 469ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:01:59] [INFO ] Deduced a trap composed of 46 places in 420 ms of which 1 ms to minimize.
[2023-03-13 15:01:59] [INFO ] Deduced a trap composed of 91 places in 372 ms of which 0 ms to minimize.
[2023-03-13 15:02:00] [INFO ] Deduced a trap composed of 86 places in 375 ms of which 0 ms to minimize.
[2023-03-13 15:02:00] [INFO ] Deduced a trap composed of 85 places in 411 ms of which 1 ms to minimize.
[2023-03-13 15:02:01] [INFO ] Deduced a trap composed of 71 places in 367 ms of which 0 ms to minimize.
[2023-03-13 15:02:01] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 0 ms to minimize.
[2023-03-13 15:02:02] [INFO ] Deduced a trap composed of 94 places in 350 ms of which 1 ms to minimize.
[2023-03-13 15:02:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3380 ms
[2023-03-13 15:02:02] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 0 ms to minimize.
[2023-03-13 15:02:02] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 0 ms to minimize.
[2023-03-13 15:02:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
[2023-03-13 15:02:03] [INFO ] After 4811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-13 15:02:03] [INFO ] After 5987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 104 ms.
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 71 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 67 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-13 15:02:03] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:03] [INFO ] Invariant cache hit.
[2023-03-13 15:02:04] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-13 15:02:04] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:04] [INFO ] Invariant cache hit.
[2023-03-13 15:02:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:02:06] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2023-03-13 15:02:06] [INFO ] Redundant transitions in 389 ms returned []
[2023-03-13 15:02:06] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:06] [INFO ] Invariant cache hit.
[2023-03-13 15:02:07] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4112 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 193 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-13 15:02:07] [INFO ] Computed 9 place invariants in 42 ms
[2023-03-13 15:02:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 15:02:08] [INFO ] After 610ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 15:02:09] [INFO ] After 1005ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:02:09] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:02:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 15:02:09] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:02:10] [INFO ] After 1120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-13 15:02:10] [INFO ] After 1417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
FORMULA BugTracking-PT-q8m004-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:02:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 15:02:10] [INFO ] Flatten gal took : 182 ms
FORMULA BugTracking-PT-q8m004-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:02:10] [INFO ] Flatten gal took : 185 ms
[2023-03-13 15:02:11] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 3 out of 277 places (down from 4) after GAL structural reductions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 12 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:02:11] [INFO ] Flatten gal took : 126 ms
[2023-03-13 15:02:11] [INFO ] Flatten gal took : 119 ms
[2023-03-13 15:02:11] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 76 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:02:12] [INFO ] Flatten gal took : 113 ms
[2023-03-13 15:02:12] [INFO ] Flatten gal took : 123 ms
[2023-03-13 15:02:12] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138396 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138396 steps, saw 79575 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:02:15] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-13 15:02:15] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-13 15:02:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:02:16] [INFO ] After 690ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:02:16] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 15:02:16] [INFO ] After 397ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:02:16] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:02:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 15:02:17] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:02:17] [INFO ] After 335ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:02:18] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 0 ms to minimize.
[2023-03-13 15:02:18] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 1 ms to minimize.
[2023-03-13 15:02:18] [INFO ] Deduced a trap composed of 46 places in 330 ms of which 1 ms to minimize.
[2023-03-13 15:02:19] [INFO ] Deduced a trap composed of 35 places in 307 ms of which 0 ms to minimize.
[2023-03-13 15:02:19] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 0 ms to minimize.
[2023-03-13 15:02:20] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 1 ms to minimize.
[2023-03-13 15:02:20] [INFO ] Deduced a trap composed of 59 places in 305 ms of which 1 ms to minimize.
[2023-03-13 15:02:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3035 ms
[2023-03-13 15:02:20] [INFO ] After 3498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-13 15:02:20] [INFO ] After 4298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 613 ms.
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 143 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 1000000 steps, including 15364 resets, run finished after 5226 ms. (steps per millisecond=191 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4373 resets, run finished after 1757 ms. (steps per millisecond=569 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 819432 steps, run timeout after 18001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 819432 steps, saw 535872 distinct states, run finished after 18001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:02:46] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-13 15:02:46] [INFO ] Computed 8 place invariants in 30 ms
[2023-03-13 15:02:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:02:47] [INFO ] After 698ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:02:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:02:47] [INFO ] After 366ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:02:47] [INFO ] After 1152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:02:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:02:48] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:02:49] [INFO ] After 342ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:02:49] [INFO ] Deduced a trap composed of 20 places in 483 ms of which 1 ms to minimize.
[2023-03-13 15:02:50] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 1 ms to minimize.
[2023-03-13 15:02:50] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 1 ms to minimize.
[2023-03-13 15:02:51] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 1 ms to minimize.
[2023-03-13 15:02:51] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 0 ms to minimize.
[2023-03-13 15:02:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2470 ms
[2023-03-13 15:02:51] [INFO ] After 2902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-13 15:02:51] [INFO ] After 3932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1082 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 44 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 44 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-13 15:02:53] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:53] [INFO ] Invariant cache hit.
[2023-03-13 15:02:53] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-13 15:02:53] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:53] [INFO ] Invariant cache hit.
[2023-03-13 15:02:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:02:55] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2023-03-13 15:02:55] [INFO ] Redundant transitions in 228 ms returned []
[2023-03-13 15:02:55] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:55] [INFO ] Invariant cache hit.
[2023-03-13 15:02:56] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3766 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 100000 steps, including 1428 resets, run finished after 1005 ms. (steps per millisecond=99 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-13 15:02:57] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:02:57] [INFO ] Invariant cache hit.
[2023-03-13 15:02:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:02:58] [INFO ] After 487ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 15:02:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:02:58] [INFO ] After 188ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-13 15:02:59] [INFO ] Deduced a trap composed of 98 places in 461 ms of which 3 ms to minimize.
[2023-03-13 15:02:59] [INFO ] Deduced a trap composed of 99 places in 434 ms of which 1 ms to minimize.
[2023-03-13 15:03:00] [INFO ] Deduced a trap composed of 107 places in 393 ms of which 1 ms to minimize.
[2023-03-13 15:03:00] [INFO ] Deduced a trap composed of 106 places in 394 ms of which 0 ms to minimize.
[2023-03-13 15:03:01] [INFO ] Deduced a trap composed of 107 places in 435 ms of which 0 ms to minimize.
[2023-03-13 15:03:01] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 1 ms to minimize.
[2023-03-13 15:03:02] [INFO ] Deduced a trap composed of 72 places in 432 ms of which 0 ms to minimize.
[2023-03-13 15:03:02] [INFO ] Deduced a trap composed of 93 places in 389 ms of which 0 ms to minimize.
[2023-03-13 15:03:03] [INFO ] Deduced a trap composed of 97 places in 387 ms of which 1 ms to minimize.
[2023-03-13 15:03:03] [INFO ] Deduced a trap composed of 100 places in 403 ms of which 0 ms to minimize.
[2023-03-13 15:03:04] [INFO ] Deduced a trap composed of 100 places in 380 ms of which 1 ms to minimize.
[2023-03-13 15:03:04] [INFO ] Deduced a trap composed of 108 places in 383 ms of which 0 ms to minimize.
[2023-03-13 15:03:05] [INFO ] Deduced a trap composed of 104 places in 380 ms of which 1 ms to minimize.
[2023-03-13 15:03:05] [INFO ] Deduced a trap composed of 94 places in 378 ms of which 0 ms to minimize.
[2023-03-13 15:03:06] [INFO ] Deduced a trap composed of 99 places in 367 ms of which 0 ms to minimize.
[2023-03-13 15:03:06] [INFO ] Deduced a trap composed of 98 places in 423 ms of which 1 ms to minimize.
[2023-03-13 15:03:07] [INFO ] Deduced a trap composed of 99 places in 446 ms of which 2 ms to minimize.
[2023-03-13 15:03:07] [INFO ] Deduced a trap composed of 103 places in 406 ms of which 1 ms to minimize.
[2023-03-13 15:03:08] [INFO ] Deduced a trap composed of 99 places in 382 ms of which 0 ms to minimize.
[2023-03-13 15:03:08] [INFO ] Deduced a trap composed of 98 places in 380 ms of which 1 ms to minimize.
[2023-03-13 15:03:09] [INFO ] Deduced a trap composed of 105 places in 376 ms of which 0 ms to minimize.
[2023-03-13 15:03:09] [INFO ] Deduced a trap composed of 101 places in 383 ms of which 1 ms to minimize.
[2023-03-13 15:03:10] [INFO ] Deduced a trap composed of 103 places in 401 ms of which 2 ms to minimize.
[2023-03-13 15:03:10] [INFO ] Deduced a trap composed of 97 places in 377 ms of which 0 ms to minimize.
[2023-03-13 15:03:11] [INFO ] Deduced a trap composed of 103 places in 373 ms of which 1 ms to minimize.
[2023-03-13 15:03:11] [INFO ] Deduced a trap composed of 100 places in 348 ms of which 1 ms to minimize.
[2023-03-13 15:03:12] [INFO ] Deduced a trap composed of 100 places in 324 ms of which 0 ms to minimize.
[2023-03-13 15:03:12] [INFO ] Deduced a trap composed of 99 places in 379 ms of which 0 ms to minimize.
[2023-03-13 15:03:13] [INFO ] Deduced a trap composed of 99 places in 320 ms of which 0 ms to minimize.
[2023-03-13 15:03:13] [INFO ] Deduced a trap composed of 104 places in 330 ms of which 1 ms to minimize.
[2023-03-13 15:03:13] [INFO ] Deduced a trap composed of 99 places in 329 ms of which 0 ms to minimize.
[2023-03-13 15:03:14] [INFO ] Deduced a trap composed of 103 places in 374 ms of which 0 ms to minimize.
[2023-03-13 15:03:14] [INFO ] Deduced a trap composed of 106 places in 398 ms of which 3 ms to minimize.
[2023-03-13 15:03:15] [INFO ] Deduced a trap composed of 98 places in 384 ms of which 1 ms to minimize.
[2023-03-13 15:03:16] [INFO ] Deduced a trap composed of 106 places in 462 ms of which 0 ms to minimize.
[2023-03-13 15:03:16] [INFO ] Deduced a trap composed of 105 places in 436 ms of which 0 ms to minimize.
[2023-03-13 15:03:17] [INFO ] Deduced a trap composed of 104 places in 473 ms of which 0 ms to minimize.
[2023-03-13 15:03:17] [INFO ] Deduced a trap composed of 99 places in 423 ms of which 1 ms to minimize.
[2023-03-13 15:03:18] [INFO ] Deduced a trap composed of 106 places in 379 ms of which 0 ms to minimize.
[2023-03-13 15:03:18] [INFO ] Deduced a trap composed of 103 places in 377 ms of which 0 ms to minimize.
[2023-03-13 15:03:19] [INFO ] Deduced a trap composed of 103 places in 407 ms of which 1 ms to minimize.
[2023-03-13 15:03:19] [INFO ] Deduced a trap composed of 103 places in 437 ms of which 1 ms to minimize.
[2023-03-13 15:03:20] [INFO ] Deduced a trap composed of 96 places in 375 ms of which 1 ms to minimize.
[2023-03-13 15:03:20] [INFO ] Deduced a trap composed of 99 places in 380 ms of which 0 ms to minimize.
[2023-03-13 15:03:21] [INFO ] Deduced a trap composed of 103 places in 417 ms of which 1 ms to minimize.
[2023-03-13 15:03:21] [INFO ] Deduced a trap composed of 102 places in 383 ms of which 1 ms to minimize.
[2023-03-13 15:03:22] [INFO ] Deduced a trap composed of 106 places in 349 ms of which 0 ms to minimize.
[2023-03-13 15:03:22] [INFO ] Deduced a trap composed of 106 places in 377 ms of which 1 ms to minimize.
[2023-03-13 15:03:23] [INFO ] Deduced a trap composed of 102 places in 372 ms of which 0 ms to minimize.
[2023-03-13 15:03:23] [INFO ] Deduced a trap composed of 106 places in 376 ms of which 1 ms to minimize.
[2023-03-13 15:03:23] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 25343 ms
[2023-03-13 15:03:24] [INFO ] After 25838ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:03:24] [INFO ] After 26371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:03:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:03:24] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:03:25] [INFO ] After 333ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:03:25] [INFO ] Deduced a trap composed of 8 places in 472 ms of which 0 ms to minimize.
[2023-03-13 15:03:26] [INFO ] Deduced a trap composed of 32 places in 456 ms of which 0 ms to minimize.
[2023-03-13 15:03:26] [INFO ] Deduced a trap composed of 41 places in 434 ms of which 1 ms to minimize.
[2023-03-13 15:03:27] [INFO ] Deduced a trap composed of 51 places in 474 ms of which 0 ms to minimize.
[2023-03-13 15:03:28] [INFO ] Deduced a trap composed of 15 places in 433 ms of which 1 ms to minimize.
[2023-03-13 15:03:28] [INFO ] Deduced a trap composed of 15 places in 442 ms of which 0 ms to minimize.
[2023-03-13 15:03:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3448 ms
[2023-03-13 15:03:29] [INFO ] Deduced a trap composed of 70 places in 413 ms of which 0 ms to minimize.
[2023-03-13 15:03:29] [INFO ] Deduced a trap composed of 70 places in 411 ms of which 0 ms to minimize.
[2023-03-13 15:03:30] [INFO ] Deduced a trap composed of 54 places in 353 ms of which 1 ms to minimize.
[2023-03-13 15:03:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1686 ms
[2023-03-13 15:03:30] [INFO ] After 5642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 15:03:30] [INFO ] After 6470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 14911 resets, run finished after 6593 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4291 resets, run finished after 2041 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1076360 steps, run timeout after 24001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 1076360 steps, saw 705233 distinct states, run finished after 24001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:04:03] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:04:03] [INFO ] Invariant cache hit.
[2023-03-13 15:04:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:04:04] [INFO ] After 768ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:04:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:04:04] [INFO ] After 414ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:04:04] [INFO ] After 1275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:04:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:04:05] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:04:05] [INFO ] After 271ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:04:06] [INFO ] Deduced a trap composed of 92 places in 342 ms of which 0 ms to minimize.
[2023-03-13 15:04:06] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 0 ms to minimize.
[2023-03-13 15:04:06] [INFO ] Deduced a trap composed of 93 places in 404 ms of which 1 ms to minimize.
[2023-03-13 15:04:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1430 ms
[2023-03-13 15:04:07] [INFO ] After 1798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-13 15:04:07] [INFO ] After 2753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1206 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 44 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 42 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-13 15:04:08] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:04:08] [INFO ] Invariant cache hit.
[2023-03-13 15:04:08] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-13 15:04:09] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:04:09] [INFO ] Invariant cache hit.
[2023-03-13 15:04:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:04:10] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
[2023-03-13 15:04:10] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-13 15:04:10] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:04:10] [INFO ] Invariant cache hit.
[2023-03-13 15:04:12] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3581 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 100000 steps, including 1544 resets, run finished after 1177 ms. (steps per millisecond=84 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-13 15:04:13] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:04:13] [INFO ] Invariant cache hit.
[2023-03-13 15:04:13] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 15:04:13] [INFO ] After 464ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 15:04:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:04:14] [INFO ] After 203ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-13 15:04:14] [INFO ] Deduced a trap composed of 98 places in 477 ms of which 2 ms to minimize.
[2023-03-13 15:04:15] [INFO ] Deduced a trap composed of 99 places in 396 ms of which 1 ms to minimize.
[2023-03-13 15:04:15] [INFO ] Deduced a trap composed of 107 places in 424 ms of which 1 ms to minimize.
[2023-03-13 15:04:16] [INFO ] Deduced a trap composed of 106 places in 463 ms of which 1 ms to minimize.
[2023-03-13 15:04:16] [INFO ] Deduced a trap composed of 107 places in 471 ms of which 1 ms to minimize.
[2023-03-13 15:04:17] [INFO ] Deduced a trap composed of 87 places in 425 ms of which 0 ms to minimize.
[2023-03-13 15:04:17] [INFO ] Deduced a trap composed of 72 places in 404 ms of which 1 ms to minimize.
[2023-03-13 15:04:18] [INFO ] Deduced a trap composed of 93 places in 381 ms of which 1 ms to minimize.
[2023-03-13 15:04:18] [INFO ] Deduced a trap composed of 97 places in 389 ms of which 1 ms to minimize.
[2023-03-13 15:04:19] [INFO ] Deduced a trap composed of 100 places in 377 ms of which 1 ms to minimize.
[2023-03-13 15:04:19] [INFO ] Deduced a trap composed of 100 places in 415 ms of which 1 ms to minimize.
[2023-03-13 15:04:20] [INFO ] Deduced a trap composed of 108 places in 388 ms of which 0 ms to minimize.
[2023-03-13 15:04:20] [INFO ] Deduced a trap composed of 104 places in 372 ms of which 1 ms to minimize.
[2023-03-13 15:04:21] [INFO ] Deduced a trap composed of 94 places in 404 ms of which 0 ms to minimize.
[2023-03-13 15:04:21] [INFO ] Deduced a trap composed of 99 places in 398 ms of which 0 ms to minimize.
[2023-03-13 15:04:22] [INFO ] Deduced a trap composed of 98 places in 394 ms of which 0 ms to minimize.
[2023-03-13 15:04:22] [INFO ] Deduced a trap composed of 99 places in 407 ms of which 0 ms to minimize.
[2023-03-13 15:04:23] [INFO ] Deduced a trap composed of 103 places in 400 ms of which 1 ms to minimize.
[2023-03-13 15:04:23] [INFO ] Deduced a trap composed of 99 places in 412 ms of which 0 ms to minimize.
[2023-03-13 15:04:24] [INFO ] Deduced a trap composed of 98 places in 417 ms of which 0 ms to minimize.
[2023-03-13 15:04:24] [INFO ] Deduced a trap composed of 105 places in 403 ms of which 1 ms to minimize.
[2023-03-13 15:04:25] [INFO ] Deduced a trap composed of 101 places in 445 ms of which 1 ms to minimize.
[2023-03-13 15:04:25] [INFO ] Deduced a trap composed of 103 places in 407 ms of which 1 ms to minimize.
[2023-03-13 15:04:26] [INFO ] Deduced a trap composed of 97 places in 377 ms of which 0 ms to minimize.
[2023-03-13 15:04:26] [INFO ] Deduced a trap composed of 103 places in 378 ms of which 1 ms to minimize.
[2023-03-13 15:04:27] [INFO ] Deduced a trap composed of 100 places in 384 ms of which 1 ms to minimize.
[2023-03-13 15:04:27] [INFO ] Deduced a trap composed of 100 places in 386 ms of which 1 ms to minimize.
[2023-03-13 15:04:28] [INFO ] Deduced a trap composed of 99 places in 374 ms of which 0 ms to minimize.
[2023-03-13 15:04:28] [INFO ] Deduced a trap composed of 99 places in 390 ms of which 0 ms to minimize.
[2023-03-13 15:04:29] [INFO ] Deduced a trap composed of 104 places in 382 ms of which 0 ms to minimize.
[2023-03-13 15:04:29] [INFO ] Deduced a trap composed of 99 places in 379 ms of which 0 ms to minimize.
[2023-03-13 15:04:30] [INFO ] Deduced a trap composed of 103 places in 402 ms of which 0 ms to minimize.
[2023-03-13 15:04:30] [INFO ] Deduced a trap composed of 106 places in 382 ms of which 1 ms to minimize.
[2023-03-13 15:04:31] [INFO ] Deduced a trap composed of 98 places in 385 ms of which 1 ms to minimize.
[2023-03-13 15:04:31] [INFO ] Deduced a trap composed of 106 places in 366 ms of which 1 ms to minimize.
[2023-03-13 15:04:32] [INFO ] Deduced a trap composed of 105 places in 389 ms of which 0 ms to minimize.
[2023-03-13 15:04:32] [INFO ] Deduced a trap composed of 104 places in 418 ms of which 0 ms to minimize.
[2023-03-13 15:04:33] [INFO ] Deduced a trap composed of 99 places in 385 ms of which 0 ms to minimize.
[2023-03-13 15:04:33] [INFO ] Deduced a trap composed of 106 places in 381 ms of which 0 ms to minimize.
[2023-03-13 15:04:34] [INFO ] Deduced a trap composed of 103 places in 372 ms of which 1 ms to minimize.
[2023-03-13 15:04:34] [INFO ] Deduced a trap composed of 103 places in 345 ms of which 0 ms to minimize.
[2023-03-13 15:04:35] [INFO ] Deduced a trap composed of 103 places in 343 ms of which 1 ms to minimize.
[2023-03-13 15:04:35] [INFO ] Deduced a trap composed of 96 places in 373 ms of which 0 ms to minimize.
[2023-03-13 15:04:36] [INFO ] Deduced a trap composed of 99 places in 392 ms of which 0 ms to minimize.
[2023-03-13 15:04:36] [INFO ] Deduced a trap composed of 103 places in 391 ms of which 2 ms to minimize.
[2023-03-13 15:04:37] [INFO ] Deduced a trap composed of 102 places in 372 ms of which 0 ms to minimize.
[2023-03-13 15:04:37] [INFO ] Deduced a trap composed of 106 places in 350 ms of which 0 ms to minimize.
[2023-03-13 15:04:38] [INFO ] Deduced a trap composed of 106 places in 348 ms of which 1 ms to minimize.
[2023-03-13 15:04:38] [INFO ] Deduced a trap composed of 102 places in 357 ms of which 1 ms to minimize.
[2023-03-13 15:04:39] [INFO ] Deduced a trap composed of 106 places in 342 ms of which 0 ms to minimize.
[2023-03-13 15:04:39] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 25252 ms
[2023-03-13 15:04:39] [INFO ] After 25739ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:04:39] [INFO ] After 26244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:04:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:04:40] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:04:40] [INFO ] After 418ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:04:41] [INFO ] Deduced a trap composed of 8 places in 451 ms of which 0 ms to minimize.
[2023-03-13 15:04:41] [INFO ] Deduced a trap composed of 32 places in 502 ms of which 0 ms to minimize.
[2023-03-13 15:04:42] [INFO ] Deduced a trap composed of 41 places in 494 ms of which 1 ms to minimize.
[2023-03-13 15:04:42] [INFO ] Deduced a trap composed of 51 places in 415 ms of which 0 ms to minimize.
[2023-03-13 15:04:43] [INFO ] Deduced a trap composed of 15 places in 451 ms of which 0 ms to minimize.
[2023-03-13 15:04:43] [INFO ] Deduced a trap composed of 15 places in 425 ms of which 0 ms to minimize.
[2023-03-13 15:04:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3387 ms
[2023-03-13 15:04:44] [INFO ] Deduced a trap composed of 70 places in 380 ms of which 1 ms to minimize.
[2023-03-13 15:04:44] [INFO ] Deduced a trap composed of 70 places in 312 ms of which 1 ms to minimize.
[2023-03-13 15:04:45] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 1 ms to minimize.
[2023-03-13 15:04:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1329 ms
[2023-03-13 15:04:45] [INFO ] After 5276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-13 15:04:45] [INFO ] After 6007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Incomplete random walk after 10001 steps, including 171 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 124749 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124749 steps, saw 81782 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:04:48] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:04:48] [INFO ] Invariant cache hit.
[2023-03-13 15:04:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:04:49] [INFO ] After 640ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:04:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:04:49] [INFO ] After 456ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:04:49] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:04:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:04:50] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:04:50] [INFO ] After 219ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:04:51] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 1 ms to minimize.
[2023-03-13 15:04:51] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 1 ms to minimize.
[2023-03-13 15:04:52] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 0 ms to minimize.
[2023-03-13 15:04:52] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 0 ms to minimize.
[2023-03-13 15:04:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1732 ms
[2023-03-13 15:04:52] [INFO ] After 2026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-13 15:04:52] [INFO ] After 2735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 3871
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 269 transition count 3871
Applied a total of 2 rules in 106 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3872 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 269/270 places, 3871/3872 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 157988 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157988 steps, saw 70008 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:04:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:04:55] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-13 15:04:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:04:56] [INFO ] After 517ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:04:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:04:56] [INFO ] After 453ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:04:56] [INFO ] After 1060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:04:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:04:57] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:04:57] [INFO ] After 249ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:04:58] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 1 ms to minimize.
[2023-03-13 15:04:58] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-13 15:04:58] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 0 ms to minimize.
[2023-03-13 15:04:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 713 ms
[2023-03-13 15:04:58] [INFO ] After 1021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-13 15:04:58] [INFO ] After 1665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 49 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:04:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:04:58] [INFO ] Invariant cache hit.
[2023-03-13 15:04:59] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-13 15:04:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:04:59] [INFO ] Invariant cache hit.
[2023-03-13 15:04:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:05:00] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-13 15:05:00] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-13 15:05:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:05:00] [INFO ] Invariant cache hit.
[2023-03-13 15:05:01] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3152 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 214 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-13 15:05:02] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-13 15:05:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 15:05:02] [INFO ] After 474ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:05:02] [INFO ] After 551ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:02] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-13 15:05:03] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:03] [INFO ] After 542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-13 15:05:03] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 145 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142601 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142601 steps, saw 93233 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:05:06] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-13 15:05:06] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-13 15:05:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:05:07] [INFO ] After 707ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:05:07] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:05:07] [INFO ] After 165ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:07] [INFO ] After 954ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:05:08] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:08] [INFO ] After 282ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:09] [INFO ] Deduced a trap composed of 10 places in 486 ms of which 1 ms to minimize.
[2023-03-13 15:05:09] [INFO ] Deduced a trap composed of 64 places in 471 ms of which 0 ms to minimize.
[2023-03-13 15:05:10] [INFO ] Deduced a trap composed of 47 places in 438 ms of which 1 ms to minimize.
[2023-03-13 15:05:10] [INFO ] Deduced a trap composed of 65 places in 455 ms of which 1 ms to minimize.
[2023-03-13 15:05:11] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 1 ms to minimize.
[2023-03-13 15:05:11] [INFO ] Deduced a trap composed of 63 places in 447 ms of which 0 ms to minimize.
[2023-03-13 15:05:12] [INFO ] Deduced a trap composed of 54 places in 403 ms of which 1 ms to minimize.
[2023-03-13 15:05:12] [INFO ] Deduced a trap composed of 62 places in 420 ms of which 0 ms to minimize.
[2023-03-13 15:05:13] [INFO ] Deduced a trap composed of 59 places in 416 ms of which 0 ms to minimize.
[2023-03-13 15:05:13] [INFO ] Deduced a trap composed of 58 places in 464 ms of which 0 ms to minimize.
[2023-03-13 15:05:14] [INFO ] Deduced a trap composed of 64 places in 417 ms of which 1 ms to minimize.
[2023-03-13 15:05:15] [INFO ] Deduced a trap composed of 65 places in 436 ms of which 1 ms to minimize.
[2023-03-13 15:05:15] [INFO ] Deduced a trap composed of 67 places in 433 ms of which 1 ms to minimize.
[2023-03-13 15:05:16] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 1 ms to minimize.
[2023-03-13 15:05:16] [INFO ] Deduced a trap composed of 61 places in 449 ms of which 0 ms to minimize.
[2023-03-13 15:05:17] [INFO ] Deduced a trap composed of 43 places in 430 ms of which 1 ms to minimize.
[2023-03-13 15:05:17] [INFO ] Deduced a trap composed of 99 places in 409 ms of which 1 ms to minimize.
[2023-03-13 15:05:18] [INFO ] Deduced a trap composed of 100 places in 390 ms of which 0 ms to minimize.
[2023-03-13 15:05:18] [INFO ] Deduced a trap composed of 59 places in 349 ms of which 0 ms to minimize.
[2023-03-13 15:05:19] [INFO ] Deduced a trap composed of 69 places in 408 ms of which 1 ms to minimize.
[2023-03-13 15:05:19] [INFO ] Deduced a trap composed of 57 places in 440 ms of which 0 ms to minimize.
[2023-03-13 15:05:20] [INFO ] Deduced a trap composed of 89 places in 452 ms of which 1 ms to minimize.
[2023-03-13 15:05:21] [INFO ] Deduced a trap composed of 93 places in 421 ms of which 0 ms to minimize.
[2023-03-13 15:05:21] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 13110 ms
[2023-03-13 15:05:21] [INFO ] After 13503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-13 15:05:21] [INFO ] After 14422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 3871
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 269 transition count 3871
Applied a total of 2 rules in 129 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3872 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 269/270 places, 3871/3872 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156790 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156790 steps, saw 69206 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:05:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:05:25] [INFO ] Computed 8 place invariants in 35 ms
[2023-03-13 15:05:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:05:25] [INFO ] After 594ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:05:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:05:25] [INFO ] After 119ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:25] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:05:26] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:26] [INFO ] After 210ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:27] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 0 ms to minimize.
[2023-03-13 15:05:27] [INFO ] Deduced a trap composed of 88 places in 520 ms of which 1 ms to minimize.
[2023-03-13 15:05:28] [INFO ] Deduced a trap composed of 89 places in 489 ms of which 1 ms to minimize.
[2023-03-13 15:05:29] [INFO ] Deduced a trap composed of 91 places in 487 ms of which 0 ms to minimize.
[2023-03-13 15:05:29] [INFO ] Deduced a trap composed of 83 places in 475 ms of which 1 ms to minimize.
[2023-03-13 15:05:30] [INFO ] Deduced a trap composed of 82 places in 525 ms of which 1 ms to minimize.
[2023-03-13 15:05:30] [INFO ] Deduced a trap composed of 97 places in 519 ms of which 0 ms to minimize.
[2023-03-13 15:05:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4328 ms
[2023-03-13 15:05:31] [INFO ] After 4614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-13 15:05:31] [INFO ] After 5368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:05:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:05:31] [INFO ] Invariant cache hit.
[2023-03-13 15:05:31] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-13 15:05:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:05:31] [INFO ] Invariant cache hit.
[2023-03-13 15:05:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:05:33] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
[2023-03-13 15:05:33] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-13 15:05:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:05:33] [INFO ] Invariant cache hit.
[2023-03-13 15:05:34] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3477 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 208 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-13 15:05:34] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-13 15:05:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 15:05:35] [INFO ] After 480ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:05:35] [INFO ] After 553ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-13 15:05:35] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 160 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-13 15:05:35] [INFO ] Computed 9 place invariants in 27 ms
[2023-03-13 15:05:35] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 15:05:36] [INFO ] After 651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:05:36] [INFO ] After 846ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:36] [INFO ] After 901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 15:05:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 15:05:37] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:37] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-13 15:05:37] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 15:05:38] [INFO ] Flatten gal took : 174 ms
[2023-03-13 15:05:38] [INFO ] Flatten gal took : 167 ms
[2023-03-13 15:05:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 15:05:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 29 ms.
Total runtime 245082 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 277 NrTr: 3871 NrArc: 19025)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.120sec

net check time: 0m 0.005sec

init dd package: 0m 3.124sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10569616 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16084924 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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.059sec

8254 36893 56112 73065 81939 89926 151516 170515 182934

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="BugTracking-PT-q8m004"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q8m004, 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 r042-tajo-167813695700394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;