Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898100243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 101K Jun 2 16:33 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 FireWire-PT-10-LTLCardinality-00
FORMULA_NAME FireWire-PT-10-LTLCardinality-01
FORMULA_NAME FireWire-PT-10-LTLCardinality-02
FORMULA_NAME FireWire-PT-10-LTLCardinality-03
FORMULA_NAME FireWire-PT-10-LTLCardinality-04
FORMULA_NAME FireWire-PT-10-LTLCardinality-05
FORMULA_NAME FireWire-PT-10-LTLCardinality-06
FORMULA_NAME FireWire-PT-10-LTLCardinality-07
FORMULA_NAME FireWire-PT-10-LTLCardinality-08
FORMULA_NAME FireWire-PT-10-LTLCardinality-09
FORMULA_NAME FireWire-PT-10-LTLCardinality-10
FORMULA_NAME FireWire-PT-10-LTLCardinality-11
FORMULA_NAME FireWire-PT-10-LTLCardinality-12
FORMULA_NAME FireWire-PT-10-LTLCardinality-13
FORMULA_NAME FireWire-PT-10-LTLCardinality-14
FORMULA_NAME FireWire-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717367023242

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:23:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:23:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:23:44] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 22:23:44] [INFO ] Transformed 131 places.
[2024-06-02 22:23:44] [INFO ] Transformed 409 transitions.
[2024-06-02 22:23:44] [INFO ] Found NUPN structural information;
[2024-06-02 22:23:44] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 347
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 128 transition count 339
Applied a total of 14 rules in 38 ms. Remains 128 /131 variables (removed 3) and now considering 339/353 (removed 14) transitions.
[2024-06-02 22:23:44] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 128 cols
[2024-06-02 22:23:44] [INFO ] Computed 8 invariants in 20 ms
[2024-06-02 22:23:45] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-02 22:23:45] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 22:23:45] [INFO ] Invariant cache hit.
[2024-06-02 22:23:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:23:45] [INFO ] Implicit Places using invariants and state equation in 289 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 613 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 339/353 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 673 ms. Remains : 127/131 places, 339/353 transitions.
Support contains 12 out of 127 places after structural reductions.
[2024-06-02 22:23:45] [INFO ] Flatten gal took : 51 ms
[2024-06-02 22:23:45] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:23:45] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 40000 steps (2210 resets) in 1657 ms. (24 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (592 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (564 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
[2024-06-02 22:23:46] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 127 cols
[2024-06-02 22:23:46] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:23:46] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/123 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 312/435 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/439 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:23:46] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 6 ms to minimize.
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 63/123 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-02 22:23:46] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 312/435 variables, 123/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 44/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/439 variables, 4/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 182 constraints, problems are : Problem set: 1 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 563ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 331
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 125 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 124 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 124 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 123 transition count 327
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 120 transition count 333
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 120 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 120 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 120 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 33 place count 118 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 118 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 117 transition count 320
Applied a total of 36 rules in 116 ms. Remains 117 /127 variables (removed 10) and now considering 320/339 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 117/127 places, 320/339 transitions.
RANDOM walk for 40000 steps (2246 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (589 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 800608 steps, run visited all 1 properties in 1356 ms. (steps per millisecond=590 )
Probabilistic random walk after 800608 steps, saw 167026 distinct states, run finished after 1362 ms. (steps per millisecond=587 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 22 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 56 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 22:23:48] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 22:23:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:23:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:23:48] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:23:48] [INFO ] Invariant cache hit.
[2024-06-02 22:23:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:23:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 251 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 10 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 318 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLCardinality-06 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 125 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 124 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 123 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 115 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 114 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 111 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 111 transition count 309
Applied a total of 38 rules in 58 ms. Remains 111 /127 variables (removed 16) and now considering 309/339 (removed 30) transitions.
[2024-06-02 22:23:49] [INFO ] Flow matrix only has 276 transitions (discarded 33 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 22:23:49] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:23:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:23:49] [INFO ] Flow matrix only has 276 transitions (discarded 33 similar events)
[2024-06-02 22:23:49] [INFO ] Invariant cache hit.
[2024-06-02 22:23:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:23:49] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 270 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/127 places, 309/339 transitions.
Applied a total of 0 rules in 15 ms. Remains 110 /110 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 110/127 places, 309/339 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-10-LTLCardinality-08 finished in 832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Applied a total of 25 rules in 15 ms. Remains 115 /127 variables (removed 12) and now considering 309/339 (removed 30) transitions.
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 115 cols
[2024-06-02 22:23:50] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:23:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 22:23:50] [INFO ] Invariant cache hit.
[2024-06-02 22:23:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:23:50] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 226 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 309/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 114/127 places, 309/339 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLCardinality-13 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 123 transition count 330
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 120 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 120 transition count 330
Applied a total of 21 rules in 26 ms. Remains 120 /127 variables (removed 7) and now considering 330/339 (removed 9) transitions.
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 22:23:50] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:23:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 22:23:50] [INFO ] Invariant cache hit.
[2024-06-02 22:23:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 22:23:50] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 22:23:50] [INFO ] Redundant transitions in 16 ms returned []
Running 329 sub problems to find dead transitions.
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 22:23:50] [INFO ] Invariant cache hit.
[2024-06-02 22:23:50] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:23:52] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:23:52] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:23:52] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:23:53] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:23:53] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 0 ms to minimize.
[2024-06-02 22:23:53] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 179 constraints, problems are : Problem set: 0 solved, 329 unsolved in 13890 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 329/507 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:24:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:24:10] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:24:11] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:24:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:24:30] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:24:30] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:24:30] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 514 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 45/46 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 13/13 constraints]
After SMT, in 44235ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 44241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/127 places, 330/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44541 ms. Remains : 120/127 places, 330/339 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 7 reset in 119 ms.
Computed a total of 19 stabilizing places and 40 stable transitions
Computed a total of 19 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (OR (AND p0 p2) (AND p0 p1))), (X p2), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 108 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2177 resets) in 768 ms. (52 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (39 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (539 resets) in 409 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (21 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (508 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
[2024-06-02 22:24:36] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 22:24:36] [INFO ] Invariant cache hit.
[2024-06-02 22:24:36] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 296/412 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 4/416 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/417 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 173 constraints, problems are : Problem set: 0 solved, 6 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 111/116 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:24:36] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:24:36] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 296/412 variables, 116/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 45/170 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 1/171 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:24:36] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 1/172 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/416 variables, 4/176 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 3/179 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/417 variables, 1/180 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/417 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 180 constraints, problems are : Problem set: 2 solved, 4 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 978ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 173 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 330/330 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 120 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 120 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 118 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 118 transition count 321
Applied a total of 14 rules in 17 ms. Remains 118 /120 variables (removed 2) and now considering 321/330 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 118/120 places, 321/330 transitions.
RANDOM walk for 40000 steps (2209 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (27 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (543 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (597 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (15 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 750325 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 4
Probabilistic random walk after 750325 steps, saw 161636 distinct states, run finished after 3007 ms. (steps per millisecond=249 ) properties seen :0
[2024-06-02 22:24:40] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
// Phase 1: matrix 292 rows 118 cols
[2024-06-02 22:24:40] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:24:40] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 109/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 292/406 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/410 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/410 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 170 constraints, problems are : Problem set: 0 solved, 4 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 109/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:24:40] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 292/406 variables, 114/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 45/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/410 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:24:41] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 321/321 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 118/118 places, 321/321 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 321/321 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-02 22:24:41] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 22:24:41] [INFO ] Invariant cache hit.
[2024-06-02 22:24:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:24:41] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 22:24:41] [INFO ] Invariant cache hit.
[2024-06-02 22:24:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:24:41] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 22:24:41] [INFO ] Redundant transitions in 6 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-02 22:24:41] [INFO ] Flow matrix only has 292 transitions (discarded 29 similar events)
[2024-06-02 22:24:41] [INFO ] Invariant cache hit.
[2024-06-02 22:24:41] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:24:43] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:24:43] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-02 22:24:43] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:24:43] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:24:43] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:24:43] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:24:44] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:24:45] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 292/410 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 178 constraints, problems are : Problem set: 0 solved, 320 unsolved in 9337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 292/410 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 320/498 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/410 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 498 constraints, problems are : Problem set: 0 solved, 320 unsolved in 16558 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 8/8 constraints]
After SMT, in 26167ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 26172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26473 ms. Remains : 118/118 places, 321/321 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 118 vertex of which 27 / 118 are part of one of the 3 SCC in 3 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 93 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 92 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 92 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 92 transition count 196
Applied a total of 13 rules in 20 ms. Remains 92 /118 variables (removed 26) and now considering 196/321 (removed 125) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:25:07] [INFO ] Flow matrix only has 194 transitions (discarded 2 similar events)
// Phase 1: matrix 194 rows 92 cols
[2024-06-02 22:25:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:25:07] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:25:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:25:08] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:25:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:25:08] [INFO ] After 67ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:25:08] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-06-02 22:25:08] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 17 ms to minimize.
[2024-06-02 22:25:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2024-06-02 22:25:08] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2024-06-02 22:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
TRAPS : Iteration 1
[2024-06-02 22:25:09] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-06-02 22:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
TRAPS : Iteration 2
[2024-06-02 22:25:09] [INFO ] Deduced a trap composed of 15 places in 662 ms of which 23 ms to minimize.
[2024-06-02 22:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 679 ms
TRAPS : Iteration 3
[2024-06-02 22:25:10] [INFO ] After 1909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:25:10] [INFO ] After 2165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2232 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (OR (AND p0 p2) (AND p0 p1))), (X p2), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 359 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 330/330 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2024-06-02 22:25:10] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 22:25:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:25:10] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 22:25:10] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 22:25:10] [INFO ] Invariant cache hit.
[2024-06-02 22:25:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 22:25:11] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 22:25:11] [INFO ] Redundant transitions in 10 ms returned []
Running 329 sub problems to find dead transitions.
[2024-06-02 22:25:11] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 22:25:11] [INFO ] Invariant cache hit.
[2024-06-02 22:25:11] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:25:12] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 179 constraints, problems are : Problem set: 0 solved, 329 unsolved in 13787 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 329/507 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:25:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:25:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:25:31] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:25:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 22:25:50] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:25:50] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:25:50] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 514 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 45/46 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 13/13 constraints]
After SMT, in 44128ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 44132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44509 ms. Remains : 120/120 places, 330/330 transitions.
Computed a total of 19 stabilizing places and 40 stable transitions
Computed a total of 19 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (2247 resets) in 103 ms. (384 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (562 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2024-06-02 22:25:55] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2024-06-02 22:25:55] [INFO ] Invariant cache hit.
[2024-06-02 22:25:55] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/116 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 296/412 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/416 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/116 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:25:55] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 296/412 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/416 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/417 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/417 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 330/330 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 120 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 120 transition count 325
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 118 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 118 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 117 transition count 320
Applied a total of 15 rules in 19 ms. Remains 117 /120 variables (removed 3) and now considering 320/330 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 117/120 places, 320/330 transitions.
RANDOM walk for 40000 steps (2380 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (511 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1259171 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :1 out of 2
Probabilistic random walk after 1259171 steps, saw 272503 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :1
[2024-06-02 22:25:59] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
// Phase 1: matrix 291 rows 117 cols
[2024-06-02 22:25:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:25:59] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/306 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/404 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 22/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/405 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/408 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/306 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/404 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 22/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/405 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/408 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 320/320 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 117/117 places, 320/320 transitions.
RANDOM walk for 40000 steps (2253 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (13 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1842183 steps, run timeout after 3001 ms. (steps per millisecond=613 ) properties seen :0 out of 1
Probabilistic random walk after 1842183 steps, saw 402749 distinct states, run finished after 3001 ms. (steps per millisecond=613 ) properties seen :0
[2024-06-02 22:26:02] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 22:26:02] [INFO ] Invariant cache hit.
[2024-06-02 22:26:02] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/306 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/404 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 22/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/405 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/408 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/306 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/404 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 22/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/405 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/408 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 320/320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-06-02 22:26:03] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 22:26:03] [INFO ] Invariant cache hit.
[2024-06-02 22:26:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:26:03] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 22:26:03] [INFO ] Invariant cache hit.
[2024-06-02 22:26:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 22:26:03] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-02 22:26:03] [INFO ] Redundant transitions in 3 ms returned []
Running 318 sub problems to find dead transitions.
[2024-06-02 22:26:03] [INFO ] Flow matrix only has 291 transitions (discarded 29 similar events)
[2024-06-02 22:26:03] [INFO ] Invariant cache hit.
[2024-06-02 22:26:03] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 22:26:04] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:26:04] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-02 22:26:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:26:04] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:26:04] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:26:04] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 22:26:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 291/407 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 175 constraints, problems are : Problem set: 0 solved, 318 unsolved in 13914 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 291/407 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 318/492 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 22:26:20] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:26:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:26:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
[2024-06-02 22:26:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/408 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 497 constraints, problems are : Problem set: 0 solved, 318 unsolved in 23547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 11/11 constraints]
After SMT, in 37689ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 37693ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37984 ms. Remains : 117/117 places, 320/320 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 117 vertex of which 27 / 117 are part of one of the 3 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 92 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 92 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 91 transition count 196
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 91 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 91 transition count 195
Applied a total of 13 rules in 17 ms. Remains 91 /117 variables (removed 26) and now considering 195/320 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:26:41] [INFO ] Flow matrix only has 193 transitions (discarded 2 similar events)
// Phase 1: matrix 193 rows 91 cols
[2024-06-02 22:26:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:26:41] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:26:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2024-06-02 22:26:41] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:26:41] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:26:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-06-02 22:26:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:26:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 2
[2024-06-02 22:26:41] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:26:41] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 348 ms.
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 2 reset in 47 ms.
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 330/330 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /120 variables (removed 1) and now considering 329/330 (removed 1) transitions.
[2024-06-02 22:26:42] [INFO ] Flow matrix only has 296 transitions (discarded 33 similar events)
// Phase 1: matrix 296 rows 119 cols
[2024-06-02 22:26:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:26:42] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:26:42] [INFO ] Flow matrix only has 296 transitions (discarded 33 similar events)
[2024-06-02 22:26:42] [INFO ] Invariant cache hit.
[2024-06-02 22:26:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 22:26:42] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 22:26:42] [INFO ] Redundant transitions in 1 ms returned []
Running 326 sub problems to find dead transitions.
[2024-06-02 22:26:42] [INFO ] Flow matrix only has 296 transitions (discarded 33 similar events)
[2024-06-02 22:26:42] [INFO ] Invariant cache hit.
[2024-06-02 22:26:42] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-02 22:26:43] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:26:43] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:26:43] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:26:43] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:26:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:26:43] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:26:44] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 295/413 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 1/414 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-02 22:26:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:26:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/415 variables, and 179 constraints, problems are : Problem set: 0 solved, 326 unsolved in 15770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 295/413 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 44/178 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 326/504 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-02 22:27:01] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:27:03] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:27:03] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (OVERLAPS) 1/414 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/415 variables, and 508 constraints, problems are : Problem set: 0 solved, 326 unsolved in 25126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 12/12 constraints]
After SMT, in 41126ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 41130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41466 ms. Remains : 119/120 places, 329/330 transitions.
Treatment of property FireWire-PT-10-LTLCardinality-14 finished in 213161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
[2024-06-02 22:27:23] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:27:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 22:27:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 339 transitions and 1258 arcs took 6 ms.
Total runtime 219526 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 127
TRANSITIONS: 339
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.002s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1068
MODEL NAME: /home/mcc/execution/406/model
127 places, 339 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-10-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717367266149

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="FireWire-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898100243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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