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.r512-smll-171654406900076.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 ltsminxred
Input is Parking-PT-416, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 107K May 18 16:43 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 Parking-PT-416-LTLFireability-00
FORMULA_NAME Parking-PT-416-LTLFireability-01
FORMULA_NAME Parking-PT-416-LTLFireability-02
FORMULA_NAME Parking-PT-416-LTLFireability-03
FORMULA_NAME Parking-PT-416-LTLFireability-04
FORMULA_NAME Parking-PT-416-LTLFireability-05
FORMULA_NAME Parking-PT-416-LTLFireability-06
FORMULA_NAME Parking-PT-416-LTLFireability-07
FORMULA_NAME Parking-PT-416-LTLFireability-08
FORMULA_NAME Parking-PT-416-LTLFireability-09
FORMULA_NAME Parking-PT-416-LTLFireability-10
FORMULA_NAME Parking-PT-416-LTLFireability-11
FORMULA_NAME Parking-PT-416-LTLFireability-12
FORMULA_NAME Parking-PT-416-LTLFireability-13
FORMULA_NAME Parking-PT-416-LTLFireability-14
FORMULA_NAME Parking-PT-416-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717245094600

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:31:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:31:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:31:37] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-06-01 12:31:37] [INFO ] Transformed 305 places.
[2024-06-01 12:31:37] [INFO ] Transformed 433 transitions.
[2024-06-01 12:31:37] [INFO ] Found NUPN structural information;
[2024-06-01 12:31:37] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Support contains 42 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Applied a total of 4 rules in 73 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2024-06-01 12:31:38] [INFO ] Computed 76 invariants in 35 ms
[2024-06-01 12:31:38] [INFO ] Implicit Places using invariants in 626 ms returned [48, 56, 64, 72, 88, 90, 125, 133, 141, 159, 187, 195, 203, 211, 227, 257, 265, 273, 297, 299]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 681 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 283/305 places, 255/257 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 271 transition count 243
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 271 transition count 243
Applied a total of 24 rules in 28 ms. Remains 271 /283 variables (removed 12) and now considering 243/255 (removed 12) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-06-01 12:31:38] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 12:31:39] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-01 12:31:39] [INFO ] Invariant cache hit.
[2024-06-01 12:31:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:31:39] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 271/305 places, 243/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1949 ms. Remains : 271/305 places, 243/257 transitions.
Support contains 42 out of 271 places after structural reductions.
[2024-06-01 12:31:40] [INFO ] Flatten gal took : 105 ms
[2024-06-01 12:31:40] [INFO ] Flatten gal took : 47 ms
[2024-06-01 12:31:40] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 40 out of 271 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (510 resets) in 2790 ms. (14 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (20 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (19 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
[2024-06-01 12:31:41] [INFO ] Invariant cache hit.
[2024-06-01 12:31:41] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 265/271 variables, 56/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/514 variables, 271/327 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 60/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/514 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 387 constraints, problems are : Problem set: 1 solved, 2 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 271/271 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 226/271 variables, 53/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 243/514 variables, 271/327 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 60/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:31:42] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/514 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 390 constraints, problems are : Problem set: 1 solved, 2 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 271/271 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1214ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 1090 steps, including 18 resets, run visited all 2 properties in 16 ms. (steps per millisecond=68 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 30 ms.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 1 stabilizing places and 1 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' '!((p0 U p1))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 263 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 262 transition count 227
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 255 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 252 transition count 224
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 252 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 70 place count 235 transition count 207
Applied a total of 70 rules in 69 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-06-01 12:31:43] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:31:43] [INFO ] Implicit Places using invariants in 238 ms returned [96, 124, 179, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 242 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 207/243 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 206
Applied a total of 2 rules in 32 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-06-01 12:31:43] [INFO ] Computed 52 invariants in 3 ms
[2024-06-01 12:31:44] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 12:31:44] [INFO ] Invariant cache hit.
[2024-06-01 12:31:44] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 206/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1085 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-00
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 6 ms.
FORMULA Parking-PT-416-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-00 finished in 1522 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))))'
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 263 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 256 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 253 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 253 transition count 225
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 70 place count 235 transition count 207
Applied a total of 70 rules in 69 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-06-01 12:31:45] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 12:31:45] [INFO ] Implicit Places using invariants in 274 ms returned [96, 124, 178, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 282 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 207/243 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 2 place count 230 transition count 206
Applied a total of 2 rules in 28 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-06-01 12:31:45] [INFO ] Computed 52 invariants in 3 ms
[2024-06-01 12:31:45] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 12:31:45] [INFO ] Invariant cache hit.
[2024-06-01 12:31:46] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 206/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1164 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-02
Product exploration explored 100000 steps with 1325 reset in 848 ms.
Product exploration explored 100000 steps with 1321 reset in 635 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 287 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (528 resets) in 666 ms. (59 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
[2024-06-01 12:31:48] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/76 variables, 35/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/112 variables, 24/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 12/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/436 variables, and 72 constraints, problems are : Problem set: 1 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 13/52 constraints, State Equation: 59/230 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 35/436 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/52 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 373 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 206/206 transitions.
Applied a total of 0 rules in 15 ms. Remains 230 /230 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 12:31:49] [INFO ] Invariant cache hit.
[2024-06-01 12:31:49] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 12:31:49] [INFO ] Invariant cache hit.
[2024-06-01 12:31:49] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-06-01 12:31:49] [INFO ] Redundant transitions in 8 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 12:31:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 282 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8040 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 138/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 420 constraints, problems are : Problem set: 0 solved, 138 unsolved in 10019 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 18111ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 18116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18955 ms. Remains : 230/230 places, 206/206 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 7557 steps (97 resets) in 55 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1317 reset in 543 ms.
Product exploration explored 100000 steps with 1327 reset in 531 ms.
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 206/206 transitions.
Applied a total of 0 rules in 8 ms. Remains 230 /230 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 12:32:09] [INFO ] Invariant cache hit.
[2024-06-01 12:32:10] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 12:32:10] [INFO ] Invariant cache hit.
[2024-06-01 12:32:10] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-06-01 12:32:10] [INFO ] Redundant transitions in 14 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 12:32:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 282 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7568 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 138/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 420 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9477 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 17089ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 17094ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17876 ms. Remains : 230/230 places, 206/206 transitions.
Treatment of property Parking-PT-416-LTLFireability-02 finished in 42798 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 74 place count 233 transition count 205
Applied a total of 74 rules in 38 ms. Remains 233 /271 variables (removed 38) and now considering 205/243 (removed 38) transitions.
// Phase 1: matrix 205 rows 233 cols
[2024-06-01 12:32:27] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:32:28] [INFO ] Implicit Places using invariants in 255 ms returned [96, 124, 178, 215]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 257 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/271 places, 205/243 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 2 place count 228 transition count 204
Applied a total of 2 rules in 18 ms. Remains 228 /229 variables (removed 1) and now considering 204/205 (removed 1) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-06-01 12:32:28] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:32:28] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 12:32:28] [INFO ] Invariant cache hit.
[2024-06-01 12:32:28] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/271 places, 204/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 918 ms. Remains : 228/271 places, 204/243 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-03
Product exploration explored 100000 steps with 1382 reset in 380 ms.
Product exploration explored 100000 steps with 1375 reset in 627 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2038 steps (25 resets) in 19 ms. (101 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 15 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 12:32:30] [INFO ] Invariant cache hit.
[2024-06-01 12:32:30] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 12:32:30] [INFO ] Invariant cache hit.
[2024-06-01 12:32:31] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-06-01 12:32:31] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 12:32:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 280 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8470 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 416 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8382 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 16897ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 16902ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17641 ms. Remains : 228/228 places, 204/204 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1528 steps (18 resets) in 12 ms. (117 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1377 reset in 542 ms.
Product exploration explored 100000 steps with 1372 reset in 354 ms.
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 11 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 12:32:50] [INFO ] Invariant cache hit.
[2024-06-01 12:32:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 12:32:50] [INFO ] Invariant cache hit.
[2024-06-01 12:32:50] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-06-01 12:32:50] [INFO ] Redundant transitions in 2 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 12:32:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 280 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8544 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 416 constraints, problems are : Problem set: 0 solved, 136 unsolved in 9118 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 17688ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 17691ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18176 ms. Remains : 228/228 places, 204/204 transitions.
Treatment of property Parking-PT-416-LTLFireability-03 finished in 40592 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' '!(X(F(p0)))'
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 9 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-06-01 12:33:08] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 12:33:08] [INFO ] Implicit Places using invariants in 244 ms returned [107, 203, 249]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 247 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/271 places, 240/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 238
Applied a total of 4 rules in 8 ms. Remains 263 /265 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-06-01 12:33:08] [INFO ] Computed 53 invariants in 3 ms
[2024-06-01 12:33:08] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 12:33:08] [INFO ] Invariant cache hit.
[2024-06-01 12:33:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:33:09] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/271 places, 238/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1172 ms. Remains : 263/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 1043 ms.
Product exploration explored 100000 steps with 50000 reset in 1038 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-04 finished in 3412 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' '!(X(X(F(p0))))'
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 269 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 269 transition count 241
Applied a total of 4 rules in 5 ms. Remains 269 /271 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-06-01 12:33:11] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 12:33:11] [INFO ] Implicit Places using invariants in 201 ms returned [107, 142, 250]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 203 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/271 places, 241/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 238
Applied a total of 6 rules in 8 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-06-01 12:33:11] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 12:33:12] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 12:33:12] [INFO ] Invariant cache hit.
[2024-06-01 12:33:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:33:12] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/271 places, 238/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 973 ms. Remains : 263/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-05
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 1097 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))))'
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 264 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 264 transition count 229
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 257 transition count 229
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 254 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 254 transition count 226
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 237 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 235 transition count 247
Applied a total of 72 rules in 38 ms. Remains 235 /271 variables (removed 36) and now considering 247/243 (removed -4) transitions.
// Phase 1: matrix 247 rows 235 cols
[2024-06-01 12:33:12] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:33:13] [INFO ] Implicit Places using invariants in 237 ms returned [96, 124, 178, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 239 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 247/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 230 transition count 262
Applied a total of 2 rules in 21 ms. Remains 230 /231 variables (removed 1) and now considering 262/247 (removed -15) transitions.
// Phase 1: matrix 262 rows 230 cols
[2024-06-01 12:33:13] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:33:13] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 12:33:13] [INFO ] Invariant cache hit.
[2024-06-01 12:33:13] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-06-01 12:33:14] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 262/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1259 ms. Remains : 230/271 places, 262/243 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-06
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-06 finished in 1323 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' '!(G(F(p0)))'
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 234 transition count 206
Applied a total of 72 rules in 39 ms. Remains 234 /271 variables (removed 37) and now considering 206/243 (removed 37) transitions.
// Phase 1: matrix 206 rows 234 cols
[2024-06-01 12:33:14] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:33:14] [INFO ] Implicit Places using invariants in 340 ms returned [96, 125, 179, 216]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 341 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/271 places, 206/243 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 2 place count 229 transition count 205
Applied a total of 2 rules in 14 ms. Remains 229 /230 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 229 cols
[2024-06-01 12:33:14] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:33:14] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 12:33:14] [INFO ] Invariant cache hit.
[2024-06-01 12:33:15] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/271 places, 205/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1145 ms. Remains : 229/271 places, 205/243 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-07
Product exploration explored 100000 steps with 1329 reset in 519 ms.
Product exploration explored 100000 steps with 1339 reset in 602 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3877 steps (49 resets) in 25 ms. (149 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-06-01 12:33:17] [INFO ] Invariant cache hit.
[2024-06-01 12:33:17] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 12:33:17] [INFO ] Invariant cache hit.
[2024-06-01 12:33:17] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2024-06-01 12:33:17] [INFO ] Redundant transitions in 2 ms returned []
Running 137 sub problems to find dead transitions.
[2024-06-01 12:33:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 281 constraints, problems are : Problem set: 0 solved, 137 unsolved in 8794 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 137/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 418 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6593 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 15429ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 15433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16243 ms. Remains : 229/229 places, 205/205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2968 steps (36 resets) in 15 ms. (185 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1342 reset in 521 ms.
Product exploration explored 100000 steps with 1332 reset in 413 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-06-01 12:33:34] [INFO ] Invariant cache hit.
[2024-06-01 12:33:35] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 12:33:35] [INFO ] Invariant cache hit.
[2024-06-01 12:33:35] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2024-06-01 12:33:35] [INFO ] Redundant transitions in 1 ms returned []
Running 137 sub problems to find dead transitions.
[2024-06-01 12:33:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 281 constraints, problems are : Problem set: 0 solved, 137 unsolved in 9228 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 137/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 418 constraints, problems are : Problem set: 0 solved, 137 unsolved in 9058 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 18349ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 18353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19001 ms. Remains : 229/229 places, 205/205 transitions.
Treatment of property Parking-PT-416-LTLFireability-07 finished in 39841 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' '!((!p0 U (G(!p0)||(!p0&&((X(p1)&&(p0||F(p2))) U p1)))))'
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 264 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 264 transition count 229
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 257 transition count 229
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 254 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 254 transition count 226
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 60 place count 241 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 239 transition count 251
Applied a total of 64 rules in 45 ms. Remains 239 /271 variables (removed 32) and now considering 251/243 (removed -8) transitions.
// Phase 1: matrix 251 rows 239 cols
[2024-06-01 12:33:54] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:33:54] [INFO ] Implicit Places using invariants in 312 ms returned [129, 182]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/271 places, 251/243 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 236 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 4 place count 235 transition count 265
Applied a total of 4 rules in 26 ms. Remains 235 /237 variables (removed 2) and now considering 265/251 (removed -14) transitions.
// Phase 1: matrix 265 rows 235 cols
[2024-06-01 12:33:54] [INFO ] Computed 54 invariants in 6 ms
[2024-06-01 12:33:54] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 12:33:54] [INFO ] Invariant cache hit.
[2024-06-01 12:33:55] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 12:33:55] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 235/271 places, 265/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1544 ms. Remains : 235/271 places, 265/243 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p2), p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : Parking-PT-416-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-08 finished in 1814 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' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 9 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-06-01 12:33:55] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:33:56] [INFO ] Implicit Places using invariants in 344 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 346 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 7 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-06-01 12:33:56] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 12:33:56] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 12:33:56] [INFO ] Invariant cache hit.
[2024-06-01 12:33:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:33:57] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1403 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 266 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Running random walk in product with property : Parking-PT-416-LTLFireability-09
Product exploration explored 100000 steps with 1282 reset in 620 ms.
Product exploration explored 100000 steps with 1284 reset in 478 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (515 resets) in 339 ms. (117 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-06-01 12:33:58] [INFO ] Invariant cache hit.
[2024-06-01 12:33:58] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/261 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/498 variables, 261/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 60/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 261/261 constraints, ReadFeed: 60/60 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/261 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:33:59] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 5 ms to minimize.
[2024-06-01 12:33:59] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 237/498 variables, 261/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 60/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 261/261 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 825ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5426 steps, including 93 resets, run visited all 1 properties in 51 ms. (steps per millisecond=106 )
Parikh walk visited 1 properties in 51 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 295 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p1))]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 237/237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 261 transition count 230
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 254 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 253 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 246 transition count 222
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 231 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 230 transition count 226
Applied a total of 62 rules in 31 ms. Remains 230 /261 variables (removed 31) and now considering 226/237 (removed 11) transitions.
// Phase 1: matrix 226 rows 230 cols
[2024-06-01 12:34:00] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 12:34:00] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 12:34:00] [INFO ] Invariant cache hit.
[2024-06-01 12:34:00] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-01 12:34:00] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-06-01 12:34:00] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 12:34:00] [INFO ] Invariant cache hit.
[2024-06-01 12:34:00] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 12:34:04] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 381 constraints, problems are : Problem set: 0 solved, 221 unsolved in 19550 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 221/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 602 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20860 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 40485ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 40489ms
Starting structural reductions in SI_LTL mode, iteration 1 : 230/261 places, 226/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41194 ms. Remains : 230/261 places, 226/237 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (527 resets) in 192 ms. (207 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-06-01 12:34:41] [INFO ] Invariant cache hit.
[2024-06-01 12:34:41] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/230 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/456 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 98/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/230 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/456 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 98/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 105 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 545 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1311 reset in 617 ms.
Product exploration explored 100000 steps with 1313 reset in 471 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-06-01 12:34:44] [INFO ] Invariant cache hit.
[2024-06-01 12:34:44] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 12:34:44] [INFO ] Invariant cache hit.
[2024-06-01 12:34:44] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-01 12:34:45] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2024-06-01 12:34:45] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 12:34:45] [INFO ] Invariant cache hit.
[2024-06-01 12:34:45] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 12:34:49] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 381 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21462 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 221/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 602 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21525 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 43132ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43138ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44217 ms. Remains : 230/230 places, 226/226 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 92479 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' '!(X(X(G(p0))))'
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 9 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-06-01 12:35:28] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:35:28] [INFO ] Implicit Places using invariants in 307 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 308 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 8 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-06-01 12:35:28] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:35:28] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-01 12:35:28] [INFO ] Invariant cache hit.
[2024-06-01 12:35:29] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:29] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1365 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-10 finished in 1557 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' '!(X(((F(!p0)&&X(p1))||(p2 U (!p1||G(p2))))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 11 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-06-01 12:35:29] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:35:30] [INFO ] Implicit Places using invariants in 336 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 338 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 7 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-06-01 12:35:30] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 12:35:30] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-01 12:35:30] [INFO ] Invariant cache hit.
[2024-06-01 12:35:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:31] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1351 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (NOT p1), p0, (AND p0 p1 (NOT p2)), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 1325 ms.
Product exploration explored 100000 steps with 50000 reset in 836 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 15 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-11 finished in 3807 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' '!(X((p0 U p1)))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 5 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-06-01 12:35:33] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:35:33] [INFO ] Implicit Places using invariants in 191 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 192 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 5 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-06-01 12:35:33] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 12:35:34] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 12:35:34] [INFO ] Invariant cache hit.
[2024-06-01 12:35:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:34] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 861 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 966 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(p1)&&p0))&&X(F(!p2))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 6 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-06-01 12:35:34] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:35:34] [INFO ] Implicit Places using invariants in 247 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 248 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 6 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-06-01 12:35:34] [INFO ] Computed 52 invariants in 3 ms
[2024-06-01 12:35:35] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 12:35:35] [INFO ] Invariant cache hit.
[2024-06-01 12:35:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:35] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1175 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0)), p2, (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-13
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 1423 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' '!(G((X((X(G(p0))||G(p1)))&&(!p2 U (p3||G(!p2))))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 269 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 269 transition count 241
Applied a total of 4 rules in 8 ms. Remains 269 /271 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-06-01 12:35:36] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:35:36] [INFO ] Implicit Places using invariants in 331 ms returned [107, 142, 203, 250]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 333 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/271 places, 241/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 262 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 262 transition count 238
Applied a total of 6 rules in 11 ms. Remains 262 /265 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 262 cols
[2024-06-01 12:35:36] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 12:35:36] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-01 12:35:36] [INFO ] Invariant cache hit.
[2024-06-01 12:35:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 12:35:37] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/271 places, 238/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1355 ms. Remains : 262/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 385 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : Parking-PT-416-LTLFireability-14
Entered a terminal (fully accepting) state of product in 7408 steps with 94 reset in 107 ms.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 1876 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||(G(p1)&&(p0||X(p0))))))'
Support contains 1 out of 271 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 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 263 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 262 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 255 transition count 227
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 253 transition count 225
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 253 transition count 225
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 70 place count 235 transition count 207
Applied a total of 70 rules in 28 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-06-01 12:35:37] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:35:38] [INFO ] Implicit Places using invariants in 245 ms returned [96, 125, 180, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 248 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 207/243 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 2 place count 230 transition count 206
Applied a total of 2 rules in 11 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-06-01 12:35:38] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 12:35:38] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 12:35:38] [INFO ] Invariant cache hit.
[2024-06-01 12:35:38] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 206/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 999 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-15
Stuttering criterion allowed to conclude after 219 steps with 2 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-15 finished in 1074 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))))'
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' '!(G((F(p0)&&F(G(p1)))))'
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' '!(G(F(p0)))'
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' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Found a Shortening insensitive property : Parking-PT-416-LTLFireability-09
Stuttering acceptance computed with spot in 249 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 264 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 263 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 256 transition count 228
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 253 transition count 225
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 253 transition count 225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 70 place count 236 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 234 transition count 246
Applied a total of 74 rules in 33 ms. Remains 234 /271 variables (removed 37) and now considering 246/243 (removed -3) transitions.
// Phase 1: matrix 246 rows 234 cols
[2024-06-01 12:35:40] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 12:35:40] [INFO ] Implicit Places using invariants in 308 ms returned [97, 125, 179, 216]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 314 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 230/271 places, 246/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 229 transition count 261
Applied a total of 2 rules in 18 ms. Remains 229 /230 variables (removed 1) and now considering 261/246 (removed -15) transitions.
// Phase 1: matrix 261 rows 229 cols
[2024-06-01 12:35:40] [INFO ] Computed 52 invariants in 3 ms
[2024-06-01 12:35:40] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 12:35:40] [INFO ] Invariant cache hit.
[2024-06-01 12:35:41] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-01 12:35:41] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 229/271 places, 261/243 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1166 ms. Remains : 229/271 places, 261/243 transitions.
Running random walk in product with property : Parking-PT-416-LTLFireability-09
Product exploration explored 100000 steps with 1346 reset in 556 ms.
Product exploration explored 100000 steps with 1337 reset in 591 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (528 resets) in 341 ms. (116 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2024-06-01 12:35:42] [INFO ] Invariant cache hit.
[2024-06-01 12:35:42] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 903 steps, including 15 resets, run visited all 1 properties in 16 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 16 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND p0 (NOT p1))]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 12 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:35:44] [INFO ] Invariant cache hit.
[2024-06-01 12:35:44] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-01 12:35:44] [INFO ] Invariant cache hit.
[2024-06-01 12:35:44] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-01 12:35:44] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2024-06-01 12:35:44] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-06-01 12:35:44] [INFO ] Invariant cache hit.
[2024-06-01 12:35:44] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 236 unsolved in 19697 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 236/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 635 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 50097ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 50102ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51024 ms. Remains : 229/229 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (535 resets) in 171 ms. (232 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2024-06-01 12:36:35] [INFO ] Invariant cache hit.
[2024-06-01 12:36:35] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4430 steps, including 75 resets, run visited all 1 properties in 23 ms. (steps per millisecond=192 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 360 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1328 reset in 507 ms.
Product exploration explored 100000 steps with 1329 reset in 552 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:36:37] [INFO ] Invariant cache hit.
[2024-06-01 12:36:37] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 12:36:37] [INFO ] Invariant cache hit.
[2024-06-01 12:36:37] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-01 12:36:38] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-06-01 12:36:38] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-06-01 12:36:38] [INFO ] Invariant cache hit.
[2024-06-01 12:36:38] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 236 unsolved in 19022 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 236/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 635 constraints, problems are : Problem set: 0 solved, 236 unsolved in 29686 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 49182ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 49185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49940 ms. Remains : 229/229 places, 261/261 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 107639 ms.
[2024-06-01 12:37:27] [INFO ] Flatten gal took : 24 ms
[2024-06-01 12:37:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 13 ms.
[2024-06-01 12:37:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 243 transitions and 809 arcs took 6 ms.
Total runtime 350405 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Parking-PT-416-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-416-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-416-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-416-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717246299059

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Parking-PT-416-LTLFireability-02
ltl formula formula --ltl=/tmp/1666/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 271 places, 243 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1666/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1666/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1666/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1666/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 272 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 272, there are 260 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~79 levels ~10000 states ~46636 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~20000 states ~105232 transitions
pnml2lts-mc( 0/ 4): ~114 levels ~40000 states ~209768 transitions
pnml2lts-mc( 1/ 4): ~79 levels ~80000 states ~417564 transitions
pnml2lts-mc( 3/ 4): ~92 levels ~160000 states ~977640 transitions
pnml2lts-mc( 1/ 4): ~79 levels ~320000 states ~1964952 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~640000 states ~4210412 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~1280000 states ~8442212 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~2560000 states ~18169704 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~5120000 states ~38619216 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~10240000 states ~81170896 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~20480000 states ~172307832 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33198172
pnml2lts-mc( 0/ 4): unique states count: 33547240
pnml2lts-mc( 0/ 4): unique transitions count: 310464759
pnml2lts-mc( 0/ 4): - self-loop count: 174
pnml2lts-mc( 0/ 4): - claim dead count: 276504600
pnml2lts-mc( 0/ 4): - claim found count: 405482
pnml2lts-mc( 0/ 4): - claim success count: 33547247
pnml2lts-mc( 0/ 4): - cum. max stack depth: 499
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547247 states 310465036 transitions, fanout: 9.255
pnml2lts-mc( 0/ 4): Total exploration time 259.300 sec (259.270 sec minimum, 259.283 sec on average)
pnml2lts-mc( 0/ 4): States per second: 129376, Transitions per second: 1197320
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.9MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 246 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.9MB (~256.0MB paged-in)
ltl formula name Parking-PT-416-LTLFireability-03
ltl formula formula --ltl=/tmp/1666/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 271 places, 243 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1666/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1666/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1666/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1666/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 272 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 272, there are 262 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~77 levels ~10000 states ~54292 transitions
pnml2lts-mc( 3/ 4): ~82 levels ~20000 states ~106016 transitions
pnml2lts-mc( 3/ 4): ~82 levels ~40000 states ~215612 transitions
pnml2lts-mc( 1/ 4): ~82 levels ~80000 states ~482564 transitions
pnml2lts-mc( 1/ 4): ~82 levels ~160000 states ~1039760 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~320000 states ~2046880 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~640000 states ~4470664 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~1280000 states ~9569972 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~2560000 states ~20414132 transitions
pnml2lts-mc( 2/ 4): ~84 levels ~5120000 states ~43382580 transitions
pnml2lts-mc( 1/ 4): ~198 levels ~10240000 states ~85073576 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~70!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10822273
pnml2lts-mc( 0/ 4): unique states count: 10864880
pnml2lts-mc( 0/ 4): unique transitions count: 102230803
pnml2lts-mc( 0/ 4): - self-loop count: 86
pnml2lts-mc( 0/ 4): - claim dead count: 91322891
pnml2lts-mc( 0/ 4): - claim found count: 33778
pnml2lts-mc( 0/ 4): - claim success count: 10864887
pnml2lts-mc( 0/ 4): - cum. max stack depth: 597
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10864887 states 102231081 transitions, fanout: 9.409
pnml2lts-mc( 0/ 4): Total exploration time 78.310 sec (78.310 sec minimum, 78.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 138742, Transitions per second: 1305466
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 84.1MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 246 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 84.1MB (~256.0MB paged-in)
ltl formula name Parking-PT-416-LTLFireability-07
ltl formula formula --ltl=/tmp/1666/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 271 places, 243 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1666/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1666/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1666/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1666/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 273 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 272, there are 248 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~86 levels ~10000 states ~56140 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~20000 states ~115672 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~40000 states ~235048 transitions
pnml2lts-mc( 1/ 4): ~205 levels ~80000 states ~424284 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~160000 states ~859288 transitions
pnml2lts-mc( 1/ 4): ~324 levels ~320000 states ~1842896 transitions
pnml2lts-mc( 1/ 4): ~324 levels ~640000 states ~4065264 transitions
pnml2lts-mc( 3/ 4): ~86 levels ~1280000 states ~10066464 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~2560000 states ~20981208 transitions
pnml2lts-mc( 0/ 4): ~144 levels ~5120000 states ~41667940 transitions
pnml2lts-mc( 0/ 4): ~144 levels ~10240000 states ~85182400 transitions
pnml2lts-mc( 1/ 4): ~334 levels ~20480000 states ~172399764 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32753809
pnml2lts-mc( 0/ 4): unique states count: 33546558
pnml2lts-mc( 0/ 4): unique transitions count: 317526614
pnml2lts-mc( 0/ 4): - self-loop count: 152
pnml2lts-mc( 0/ 4): - claim dead count: 282877376
pnml2lts-mc( 0/ 4): - claim found count: 1094446
pnml2lts-mc( 0/ 4): - claim success count: 33546564
pnml2lts-mc( 0/ 4): - cum. max stack depth: 663
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33546564 states 317526824 transitions, fanout: 9.465
pnml2lts-mc( 0/ 4): Total exploration time 248.280 sec (248.270 sec minimum, 248.275 sec on average)
pnml2lts-mc( 0/ 4): States per second: 135116, Transitions per second: 1278906
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.4MB, 8.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 246 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.4MB (~256.0MB paged-in)
ltl formula name Parking-PT-416-LTLFireability-09
ltl formula formula --ltl=/tmp/1666/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 271 places, 243 transitions and 809 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1666/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1666/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1666/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1666/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 272 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 272, there are 277 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~67 levels ~10000 states ~54456 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~20000 states ~110720 transitions
pnml2lts-mc( 0/ 4): ~67 levels ~40000 states ~231600 transitions
pnml2lts-mc( 3/ 4): ~206 levels ~80000 states ~442628 transitions
pnml2lts-mc( 3/ 4): ~206 levels ~160000 states ~967084 transitions
pnml2lts-mc( 3/ 4): ~206 levels ~320000 states ~2101756 transitions
pnml2lts-mc( 3/ 4): ~206 levels ~640000 states ~4533936 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~1280000 states ~9343700 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~2560000 states ~20099868 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~5120000 states ~41360556 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~10240000 states ~87928512 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~20480000 states ~184328100 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32759060
pnml2lts-mc( 0/ 4): unique states count: 33547079
pnml2lts-mc( 0/ 4): unique transitions count: 407076189
pnml2lts-mc( 0/ 4): - self-loop count: 101
pnml2lts-mc( 0/ 4): - claim dead count: 372501208
pnml2lts-mc( 0/ 4): - claim found count: 1017988
pnml2lts-mc( 0/ 4): - claim success count: 33547086
pnml2lts-mc( 0/ 4): - cum. max stack depth: 687
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547086 states 407076462 transitions, fanout: 12.134
pnml2lts-mc( 0/ 4): Total exploration time 263.200 sec (263.150 sec minimum, 263.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 127459, Transitions per second: 1546643
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.2MB, 8.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 246 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.2MB (~256.0MB paged-in)

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="Parking-PT-416"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Parking-PT-416, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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