MCC'2024- Execution of r069-tall-171620504400364

About the Execution of GreatSPN+red for CircularTrains-PT-384

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
13518.979	2376417.00	5141908.00	4702.80	?F?FF?T????FFF?T	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K May 18 16:42 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 CircularTrains-PT-384-LTLFireability-00
FORMULA_NAME CircularTrains-PT-384-LTLFireability-01
FORMULA_NAME CircularTrains-PT-384-LTLFireability-02
FORMULA_NAME CircularTrains-PT-384-LTLFireability-03
FORMULA_NAME CircularTrains-PT-384-LTLFireability-04
FORMULA_NAME CircularTrains-PT-384-LTLFireability-05
FORMULA_NAME CircularTrains-PT-384-LTLFireability-06
FORMULA_NAME CircularTrains-PT-384-LTLFireability-07
FORMULA_NAME CircularTrains-PT-384-LTLFireability-08
FORMULA_NAME CircularTrains-PT-384-LTLFireability-09
FORMULA_NAME CircularTrains-PT-384-LTLFireability-10
FORMULA_NAME CircularTrains-PT-384-LTLFireability-11
FORMULA_NAME CircularTrains-PT-384-LTLFireability-12
FORMULA_NAME CircularTrains-PT-384-LTLFireability-13
FORMULA_NAME CircularTrains-PT-384-LTLFireability-14
FORMULA_NAME CircularTrains-PT-384-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716431855140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:37:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:37:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:37:36] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-23 02:37:36] [INFO ] Transformed 768 places.
[2024-05-23 02:37:36] [INFO ] Transformed 384 transitions.
[2024-05-23 02:37:36] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 99 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2024-05-23 02:37:36] [INFO ] Computed 385 invariants in 64 ms
[2024-05-23 02:37:37] [INFO ] Implicit Places using invariants in 786 ms returned [1, 7, 9, 21, 26, 32, 42, 46, 48, 58, 63, 64, 71, 86, 88, 98, 103, 107, 108, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 221, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 340, 346, 347, 350, 353, 354, 357, 365, 383, 390, 397, 411, 412, 426, 433, 447, 448, 449, 470, 475, 476, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 579, 580, 586, 600, 619, 622, 625, 628, 638, 643, 644, 647, 648, 662, 666, 671, 674, 689, 693, 700, 708, 715, 718, 719, 723, 732, 735, 740, 741, 746, 747, 749, 758, 759, 760, 763]
Discarding 113 places :
Implicit Place search using SMT only with invariants took 832 ms to find 113 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 655/768 places, 384/384 transitions.
Applied a total of 0 rules in 33 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 979 ms. Remains : 655/768 places, 384/384 transitions.
Support contains 54 out of 655 places after structural reductions.
[2024-05-23 02:37:38] [INFO ] Flatten gal took : 59 ms
[2024-05-23 02:37:38] [INFO ] Flatten gal took : 32 ms
[2024-05-23 02:37:38] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 48 out of 655 places (down from 54) after GAL structural reductions.
RANDOM walk for 1572 steps (0 resets) in 387 ms. (4 steps per ms) remains 0/24 properties
FORMULA CircularTrains-PT-384-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(G(F(p0)))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 69 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-23 02:37:38] [INFO ] Computed 272 invariants in 9 ms
[2024-05-23 02:37:39] [INFO ] Implicit Places using invariants in 341 ms returned [12, 63, 79, 238, 241, 250, 285, 296, 342, 400, 423, 466, 515, 521]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 343 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 22 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-23 02:37:39] [INFO ] Computed 258 invariants in 3 ms
[2024-05-23 02:37:39] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-23 02:37:39] [INFO ] Invariant cache hit.
[2024-05-23 02:37:39] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1192 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-00
Product exploration explored 100000 steps with 1024 reset in 2055 ms.
Product exploration explored 100000 steps with 1017 reset in 2111 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 178 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 405 steps (0 resets) in 25 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 159 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:37:45] [INFO ] Invariant cache hit.
[2024-05-23 02:37:45] [INFO ] [Real]Absence check using 254 positive place invariants in 78 ms returned sat
[2024-05-23 02:37:45] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 28 ms returned sat
[2024-05-23 02:37:46] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2024-05-23 02:37:46] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-23 02:38:00] [INFO ] Added : 125 causal constraints over 25 iterations in 13770 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:38:00] [INFO ] Invariant cache hit.
[2024-05-23 02:38:00] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 02:38:00] [INFO ] Invariant cache hit.
[2024-05-23 02:38:00] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-23 02:38:00] [INFO ] Redundant transitions in 10 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:38:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9039 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39107ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39880 ms. Remains : 514/514 places, 257/257 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 502 steps (0 resets) in 23 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 189 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:38:40] [INFO ] Invariant cache hit.
[2024-05-23 02:38:40] [INFO ] [Real]Absence check using 254 positive place invariants in 74 ms returned sat
[2024-05-23 02:38:41] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 27 ms returned sat
[2024-05-23 02:38:41] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2024-05-23 02:38:42] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-23 02:38:55] [INFO ] Added : 125 causal constraints over 25 iterations in 13786 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1041 reset in 1802 ms.
Product exploration explored 100000 steps with 1082 reset in 1966 ms.
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:38:59] [INFO ] Invariant cache hit.
[2024-05-23 02:38:59] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-23 02:38:59] [INFO ] Invariant cache hit.
[2024-05-23 02:39:00] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-23 02:39:00] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:39:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8774 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38812ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38814ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39543 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-00 finished in 120559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-23 02:39:39] [INFO ] Computed 272 invariants in 10 ms
[2024-05-23 02:39:39] [INFO ] Implicit Places using invariants in 339 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 583, 637, 646, 651]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 344 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 640/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-01
Entered a terminal (fully accepting) state of product in 77 steps with 0 reset in 5 ms.
FORMULA CircularTrains-PT-384-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-01 finished in 560 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)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:39:39] [INFO ] Invariant cache hit.
[2024-05-23 02:39:40] [INFO ] Implicit Places using invariants in 363 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 637, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 364 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 766 reset in 1925 ms.
Product exploration explored 100000 steps with 762 reset in 1993 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 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 977 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 7098 steps (0 resets) in 181 ms. (39 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1362 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2024-05-23 02:39:47] [INFO ] Computed 259 invariants in 12 ms
[2024-05-23 02:39:47] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 02:39:47] [INFO ] Invariant cache hit.
[2024-05-23 02:39:48] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:39:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 25190 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 55248ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 55256ms
Finished structural reductions in LTL mode , in 1 iterations and 56100 ms. Remains : 642/642 places, 384/384 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 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 969 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 12821 steps (2 resets) in 364 ms. (35 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1307 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 789 reset in 1940 ms.
Product exploration explored 100000 steps with 790 reset in 2059 ms.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:40:50] [INFO ] Invariant cache hit.
[2024-05-23 02:40:51] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-23 02:40:51] [INFO ] Invariant cache hit.
[2024-05-23 02:40:51] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23808 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53857ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53860ms
Finished structural reductions in LTL mode , in 1 iterations and 54834 ms. Remains : 642/642 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 125630 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 U X(X(X(!p2))))||G(!p0)))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-23 02:41:45] [INFO ] Computed 272 invariants in 3 ms
[2024-05-23 02:41:45] [INFO ] Implicit Places using invariants in 426 ms returned [14, 72, 90, 287, 290, 303, 348, 420, 499, 583, 637, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 450 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 474 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 580 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), p2, (AND p0 p2), (AND p0 p2), p2, true, p2, p2, p2, p2, p2, p2, p2]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-04
Entered a terminal (fully accepting) state of product in 435 steps with 38 reset in 11 ms.
FORMULA CircularTrains-PT-384-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-04 finished in 1092 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)) U p1))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 40 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-05-23 02:41:46] [INFO ] Computed 272 invariants in 3 ms
[2024-05-23 02:41:47] [INFO ] Implicit Places using invariants in 412 ms returned [12, 63, 79, 239, 242, 286, 297, 401, 424, 467, 516, 522, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 417 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 19 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-05-23 02:41:47] [INFO ] Computed 259 invariants in 2 ms
[2024-05-23 02:41:47] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 02:41:47] [INFO ] Invariant cache hit.
[2024-05-23 02:41:47] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1252 ms. Remains : 516/655 places, 258/384 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05
Product exploration explored 100000 steps with 973 reset in 1829 ms.
Product exploration explored 100000 steps with 1011 reset in 1954 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 (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 406 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 94 ms :[(NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 814 steps (0 resets) in 27 ms. (29 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 417 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 93 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-05-23 02:41:52] [INFO ] Invariant cache hit.
[2024-05-23 02:41:53] [INFO ] [Real]Absence check using 256 positive place invariants in 74 ms returned sat
[2024-05-23 02:41:53] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 33 ms returned sat
[2024-05-23 02:41:54] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2024-05-23 02:41:54] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-23 02:42:07] [INFO ] Added : 127 causal constraints over 26 iterations in 13720 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 18 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 02:42:08] [INFO ] Invariant cache hit.
[2024-05-23 02:42:08] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-23 02:42:08] [INFO ] Invariant cache hit.
[2024-05-23 02:42:08] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-05-23 02:42:08] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-23 02:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9605 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39628ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40473 ms. Remains : 516/516 places, 258/258 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 (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 315 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 89 ms :[(NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 754 steps (0 resets) in 27 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 521 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 103 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-05-23 02:42:49] [INFO ] Invariant cache hit.
[2024-05-23 02:42:49] [INFO ] [Real]Absence check using 256 positive place invariants in 72 ms returned sat
[2024-05-23 02:42:49] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 32 ms returned sat
[2024-05-23 02:42:51] [INFO ] [Real]Absence check using state equation in 1054 ms returned sat
[2024-05-23 02:42:51] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:43:04] [INFO ] Added : 125 causal constraints over 25 iterations in 13672 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1065 reset in 1815 ms.
Product exploration explored 100000 steps with 1013 reset in 1945 ms.
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 02:43:08] [INFO ] Invariant cache hit.
[2024-05-23 02:43:08] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 02:43:08] [INFO ] Invariant cache hit.
[2024-05-23 02:43:09] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-05-23 02:43:09] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-23 02:43:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39479ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39481ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40240 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 122285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
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 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 74 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-23 02:43:48] [INFO ] Computed 272 invariants in 3 ms
[2024-05-23 02:43:49] [INFO ] Implicit Places using invariants in 313 ms returned [63, 79, 239, 242, 251, 286, 297, 343, 400, 423, 466, 515, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 323 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 15 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-23 02:43:49] [INFO ] Computed 258 invariants in 2 ms
[2024-05-23 02:43:49] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-23 02:43:49] [INFO ] Invariant cache hit.
[2024-05-23 02:43:50] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1193 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-07
Product exploration explored 100000 steps with 1060 reset in 1874 ms.
Product exploration explored 100000 steps with 1053 reset in 1997 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 328 steps (0 resets) in 13 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-23 02:43:54] [INFO ] Invariant cache hit.
[2024-05-23 02:43:54] [INFO ] [Real]Absence check using 255 positive place invariants in 71 ms returned sat
[2024-05-23 02:43:54] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 30 ms returned sat
[2024-05-23 02:43:55] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2024-05-23 02:43:56] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-23 02:44:09] [INFO ] Added : 120 causal constraints over 24 iterations in 13527 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:44:09] [INFO ] Invariant cache hit.
[2024-05-23 02:44:09] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-23 02:44:09] [INFO ] Invariant cache hit.
[2024-05-23 02:44:10] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-23 02:44:10] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:44:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8380 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38413ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39133 ms. Remains : 514/514 places, 257/257 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 218 steps (0 resets) in 14 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-23 02:44:49] [INFO ] Invariant cache hit.
[2024-05-23 02:44:49] [INFO ] [Real]Absence check using 255 positive place invariants in 69 ms returned sat
[2024-05-23 02:44:49] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 27 ms returned sat
[2024-05-23 02:44:50] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2024-05-23 02:44:50] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-23 02:45:04] [INFO ] Added : 120 causal constraints over 24 iterations in 13576 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1034 reset in 1887 ms.
Product exploration explored 100000 steps with 1093 reset in 1998 ms.
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:45:08] [INFO ] Invariant cache hit.
[2024-05-23 02:45:08] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-23 02:45:08] [INFO ] Invariant cache hit.
[2024-05-23 02:45:08] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-05-23 02:45:08] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:45:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8664 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38700ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39443 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-07 finished in 118665 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 U (p1||G(!p0))))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 39 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-05-23 02:45:47] [INFO ] Computed 272 invariants in 2 ms
[2024-05-23 02:45:47] [INFO ] Implicit Places using invariants in 306 ms returned [12, 63, 240, 243, 252, 287, 298, 344, 401, 424, 467, 516, 522, 527]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 308 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/655 places, 259/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 516 transition count 258
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 514 transition count 257
Applied a total of 4 rules in 18 ms. Remains 514 /516 variables (removed 2) and now considering 257/259 (removed 2) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-23 02:45:47] [INFO ] Computed 258 invariants in 2 ms
[2024-05-23 02:45:48] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 02:45:48] [INFO ] Invariant cache hit.
[2024-05-23 02:45:48] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1067 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08
Product exploration explored 100000 steps with 541 reset in 1836 ms.
Product exploration explored 100000 steps with 559 reset in 1939 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 357 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1061 ms. (37 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 1/1 properties
[2024-05-23 02:45:53] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/771 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/256 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 404 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 16 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:45:53] [INFO ] Invariant cache hit.
[2024-05-23 02:45:54] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 02:45:54] [INFO ] Invariant cache hit.
[2024-05-23 02:45:54] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-05-23 02:45:54] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:45:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8584 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38612ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39392 ms. Remains : 514/514 places, 257/257 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]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 156 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 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 548 steps (0 resets) in 14 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 149 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 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 563 reset in 1768 ms.
Product exploration explored 100000 steps with 549 reset in 1901 ms.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:46:37] [INFO ] Invariant cache hit.
[2024-05-23 02:46:38] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 02:46:38] [INFO ] Invariant cache hit.
[2024-05-23 02:46:38] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2024-05-23 02:46:38] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:46:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8557 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38595ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38596ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39431 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 89591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 558 transition count 287
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 194 place count 558 transition count 271
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 226 place count 542 transition count 271
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 528 transition count 257
Applied a total of 254 rules in 27 ms. Remains 528 /655 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 528 cols
[2024-05-23 02:47:17] [INFO ] Computed 272 invariants in 2 ms
[2024-05-23 02:47:17] [INFO ] Implicit Places using invariants in 404 ms returned [12, 63, 79, 238, 241, 250, 285, 296, 342, 399, 422, 465, 514, 520, 525]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 421 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/655 places, 257/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 23 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2024-05-23 02:47:17] [INFO ] Computed 257 invariants in 2 ms
[2024-05-23 02:47:17] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 02:47:17] [INFO ] Invariant cache hit.
[2024-05-23 02:47:18] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/655 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1178 ms. Remains : 512/655 places, 256/384 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09
Product exploration explored 100000 steps with 720 reset in 1800 ms.
Product exploration explored 100000 steps with 731 reset in 1940 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 828 steps (0 resets) in 27 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-05-23 02:47:22] [INFO ] Invariant cache hit.
[2024-05-23 02:47:22] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-05-23 02:47:22] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-23 02:47:23] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2024-05-23 02:47:23] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-23 02:47:37] [INFO ] Added : 126 causal constraints over 26 iterations in 13684 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 16 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:47:37] [INFO ] Invariant cache hit.
[2024-05-23 02:47:37] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-23 02:47:37] [INFO ] Invariant cache hit.
[2024-05-23 02:47:38] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2024-05-23 02:47:38] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:47:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8346 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38377ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39131 ms. Remains : 512/512 places, 256/256 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 712 steps (0 resets) in 19 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-23 02:48:17] [INFO ] Invariant cache hit.
[2024-05-23 02:48:17] [INFO ] [Real]Absence check using 255 positive place invariants in 78 ms returned sat
[2024-05-23 02:48:17] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-23 02:48:18] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2024-05-23 02:48:18] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-23 02:48:32] [INFO ] Added : 126 causal constraints over 26 iterations in 13653 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 731 reset in 1808 ms.
Product exploration explored 100000 steps with 744 reset in 2000 ms.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
[2024-05-23 02:48:36] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
[2024-05-23 02:48:36] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-23 02:48:36] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8519 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38552ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38554ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39314 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 118274 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 G((X(p1)||F(p2)))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-23 02:49:15] [INFO ] Computed 272 invariants in 5 ms
[2024-05-23 02:49:15] [INFO ] Implicit Places using invariants in 371 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 583, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 386 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 22337 reset in 1846 ms.
Product exploration explored 100000 steps with 22683 reset in 1984 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 (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 818 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1528 steps (0 resets) in 66 ms. (22 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p0))), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 937 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
// Phase 1: matrix 384 rows 641 cols
[2024-05-23 02:49:22] [INFO ] Computed 258 invariants in 4 ms
[2024-05-23 02:49:23] [INFO ] [Real]Absence check using 255 positive place invariants in 85 ms returned sat
[2024-05-23 02:49:23] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 26 ms returned sat
[2024-05-23 02:49:25] [INFO ] [Real]Absence check using state equation in 2716 ms returned sat
[2024-05-23 02:49:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:49:26] [INFO ] [Nat]Absence check using 255 positive place invariants in 83 ms returned sat
[2024-05-23 02:49:26] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 29 ms returned sat
[2024-05-23 02:49:31] [INFO ] [Nat]Absence check using state equation in 4691 ms returned sat
[2024-05-23 02:49:31] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-23 02:49:41] [INFO ] Added : 75 causal constraints over 15 iterations in 9936 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:49:41] [INFO ] Invariant cache hit.
[2024-05-23 02:49:41] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-23 02:49:41] [INFO ] Invariant cache hit.
[2024-05-23 02:49:41] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:49:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 24795 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 54851ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 54854ms
Finished structural reductions in LTL mode , in 1 iterations and 55671 ms. Remains : 641/641 places, 384/384 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 (NOT p2) (NOT p1) p0), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 707 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1092 steps (0 resets) in 28 ms. (37 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p0))), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 847 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
[2024-05-23 02:50:39] [INFO ] Invariant cache hit.
[2024-05-23 02:50:39] [INFO ] [Real]Absence check using 255 positive place invariants in 80 ms returned sat
[2024-05-23 02:50:39] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 34 ms returned sat
[2024-05-23 02:50:41] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2024-05-23 02:50:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:41] [INFO ] [Nat]Absence check using 255 positive place invariants in 78 ms returned sat
[2024-05-23 02:50:41] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 23 ms returned sat
[2024-05-23 02:50:45] [INFO ] [Nat]Absence check using state equation in 4168 ms returned sat
[2024-05-23 02:50:45] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-23 02:50:56] [INFO ] Added : 80 causal constraints over 16 iterations in 10507 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 22330 reset in 1865 ms.
Product exploration explored 100000 steps with 21988 reset in 1978 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 641 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 124 place count 641 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 641 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 641 transition count 384
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 127 rules in 99 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:51:01] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 641 cols
[2024-05-23 02:51:01] [INFO ] Computed 258 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 02:51:06] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 11 ms to minimize.
[2024-05-23 02:51:06] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 10 ms to minimize.
[2024-05-23 02:51:06] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-23 02:51:06] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 4 ms to minimize.
[2024-05-23 02:51:06] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 3 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 10 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 13 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-23 02:51:07] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-05-23 02:51:08] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-23 02:51:08] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-23 02:51:08] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 20/277 constraints. Problems are: Problem set: 20 solved, 236 unsolved
[2024-05-23 02:51:08] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:51:08] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:51:08] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 15 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 8 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 7 ms to minimize.
[2024-05-23 02:51:09] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 20/297 constraints. Problems are: Problem set: 40 solved, 216 unsolved
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-23 02:51:10] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 17 ms to minimize.
[2024-05-23 02:51:11] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-23 02:51:12] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-23 02:51:12] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 20/317 constraints. Problems are: Problem set: 60 solved, 196 unsolved
[2024-05-23 02:51:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-23 02:51:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD215 is UNSAT
[2024-05-23 02:51:15] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-23 02:51:15] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-23 02:51:15] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-23 02:51:15] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD234 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 20/337 constraints. Problems are: Problem set: 80 solved, 176 unsolved
[2024-05-23 02:51:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:51:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-23 02:51:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 5 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD166 is UNSAT
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:51:17] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 20/357 constraints. Problems are: Problem set: 100 solved, 156 unsolved
[2024-05-23 02:51:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:51:19] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-23 02:51:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-23 02:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-23 02:51:20] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 5/362 constraints. Problems are: Problem set: 105 solved, 151 unsolved
[2024-05-23 02:51:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:51:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-23 02:51:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 5 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-23 02:51:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:51:23] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 5/367 constraints. Problems are: Problem set: 110 solved, 146 unsolved
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:51:24] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 9/376 constraints. Problems are: Problem set: 118 solved, 138 unsolved
[2024-05-23 02:51:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 1/377 constraints. Problems are: Problem set: 119 solved, 137 unsolved
[2024-05-23 02:51:29] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:51:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-23 02:51:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:51:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 13 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 4/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/1025 variables, and 381 constraints, problems are : Problem set: 123 solved, 133 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 123 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 378/640 variables, 255/255 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 124/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/1023 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 129/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/1025 variables, 0/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1152 constraints, problems are : Problem set: 127 solved, 129 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 129/256 constraints, Known Traps: 124/124 constraints]
After SMT, in 60067ms problems are : Problem set: 127 solved, 129 unsolved
Search for dead transitions found 127 dead transitions in 60070ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 641/641 places, 257/384 transitions.
Graph (complete) has 1028 edges and 641 vertex of which 514 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.3 ms
Discarding 127 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 514 /641 variables (removed 127) and now considering 257/257 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/641 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60199 ms. Remains : 514/641 places, 257/384 transitions.
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 29 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2024-05-23 02:52:01] [INFO ] Computed 258 invariants in 3 ms
[2024-05-23 02:52:01] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-23 02:52:01] [INFO ] Invariant cache hit.
[2024-05-23 02:52:01] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 25069 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 55116ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 55118ms
Finished structural reductions in LTL mode , in 1 iterations and 55960 ms. Remains : 641/641 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 221728 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(p0)||X(G(!p0))))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-23 02:52:57] [INFO ] Computed 272 invariants in 7 ms
[2024-05-23 02:52:57] [INFO ] Implicit Places using invariants in 377 ms returned [14, 72, 90, 290, 303, 348, 365, 420, 499, 526, 583, 637, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 378 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 408 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 4 ms.
FORMULA CircularTrains-PT-384-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 601 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 (F(G((!p1||X(!p2))))||G(!p3))))'
Support contains 8 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 19 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:52:57] [INFO ] Invariant cache hit.
[2024-05-23 02:52:58] [INFO ] Implicit Places using invariants in 355 ms returned [14, 72, 90, 287, 303, 348, 365, 420, 526, 583, 637, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 356 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 386 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND p1 p2 p3), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2 p3), (AND p1 p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14
Product exploration explored 100000 steps with 280 reset in 1617 ms.
Product exploration explored 100000 steps with 306 reset in 1760 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 (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT p2)), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 30 factoid took 1072 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 3297 steps (0 resets) in 70 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT p2)), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 30 factoid took 1115 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 144 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Support contains 6 out of 642 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2024-05-23 02:53:04] [INFO ] Computed 259 invariants in 4 ms
[2024-05-23 02:53:04] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-23 02:53:04] [INFO ] Invariant cache hit.
[2024-05-23 02:53:05] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:53:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 24625 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 54688ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 54691ms
Finished structural reductions in LTL mode , in 1 iterations and 55507 ms. Remains : 642/642 places, 384/384 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 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 3104 steps (0 resets) in 72 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3)]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 162 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 286 reset in 1612 ms.
Product exploration explored 100000 steps with 286 reset in 1749 ms.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:54:04] [INFO ] Invariant cache hit.
[2024-05-23 02:54:05] [INFO ] Implicit Places using invariants in 337 ms returned [286]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/642 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 357 ms. Remains : 641/642 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 67394 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)))'
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)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLFireability-02
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 655 transition count 286
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 197 place count 557 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 29 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-05-23 02:54:05] [INFO ] Computed 272 invariants in 4 ms
[2024-05-23 02:54:05] [INFO ] Implicit Places using invariants in 319 ms returned [12, 63, 79, 239, 242, 251, 286, 297, 344, 401, 424, 516, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 321 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 517/655 places, 259/384 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 516 transition count 258
Applied a total of 2 rules in 18 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-05-23 02:54:05] [INFO ] Computed 259 invariants in 3 ms
[2024-05-23 02:54:06] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-23 02:54:06] [INFO ] Invariant cache hit.
[2024-05-23 02:54:06] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1081 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 863 reset in 1932 ms.
Product exploration explored 100000 steps with 856 reset in 2086 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 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1136 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 3009 steps (0 resets) in 113 ms. (26 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1295 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 02:54:13] [INFO ] Invariant cache hit.
[2024-05-23 02:54:13] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 02:54:14] [INFO ] Invariant cache hit.
[2024-05-23 02:54:14] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-23 02:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9971 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 40010ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 40011ms
Finished structural reductions in LTL mode , in 1 iterations and 40782 ms. Remains : 516/516 places, 258/258 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 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1047 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 7366 steps (1 resets) in 233 ms. (31 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1250 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 821 reset in 1966 ms.
Product exploration explored 100000 steps with 877 reset in 2091 ms.
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 02:55:01] [INFO ] Invariant cache hit.
[2024-05-23 02:55:01] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 02:55:01] [INFO ] Invariant cache hit.
[2024-05-23 02:55:02] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-23 02:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9778 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39818ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39820ms
Finished structural reductions in LTL mode , in 1 iterations and 40581 ms. Remains : 516/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 97016 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)) U 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' '!(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' '!(G(F((!p0 U (p1||G(!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' '!(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(p0) U G((X(p1)||F(p2)))))'
Found a Lengthening insensitive property : CircularTrains-PT-384-LTLFireability-10
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 558 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 557 transition count 286
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 196 place count 557 transition count 272
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 24 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-23 02:55:43] [INFO ] Computed 272 invariants in 2 ms
[2024-05-23 02:55:43] [INFO ] Implicit Places using invariants in 309 ms returned [12, 64, 80, 239, 242, 251, 286, 297, 343, 400, 423, 466, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 328 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 11 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-23 02:55:43] [INFO ] Computed 258 invariants in 5 ms
[2024-05-23 02:55:43] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-23 02:55:43] [INFO ] Invariant cache hit.
[2024-05-23 02:55:44] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1128 ms. Remains : 514/655 places, 257/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 22773 reset in 1889 ms.
Product exploration explored 100000 steps with 23058 reset in 2009 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 (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 759 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1352 steps (0 resets) in 38 ms. (34 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p2))), (F p1)]
Knowledge based reduction with 1 factoid took 917 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
[2024-05-23 02:55:50] [INFO ] Invariant cache hit.
[2024-05-23 02:55:50] [INFO ] [Real]Absence check using 255 positive place invariants in 71 ms returned sat
[2024-05-23 02:55:51] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 22 ms returned sat
[2024-05-23 02:55:51] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-05-23 02:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:55:52] [INFO ] [Nat]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-23 02:55:52] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-23 02:55:53] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2024-05-23 02:55:53] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:56:06] [INFO ] Added : 126 causal constraints over 26 iterations in 12952 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:56:06] [INFO ] Invariant cache hit.
[2024-05-23 02:56:07] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 02:56:07] [INFO ] Invariant cache hit.
[2024-05-23 02:56:07] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-23 02:56:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9541 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39579ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39580ms
Finished structural reductions in LTL mode , in 1 iterations and 40343 ms. Remains : 514/514 places, 257/257 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 (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 715 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1098 steps (0 resets) in 28 ms. (37 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p2))), (F p1)]
Knowledge based reduction with 1 factoid took 923 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
[2024-05-23 02:56:49] [INFO ] Invariant cache hit.
[2024-05-23 02:56:50] [INFO ] [Real]Absence check using 255 positive place invariants in 77 ms returned sat
[2024-05-23 02:56:50] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 23 ms returned sat
[2024-05-23 02:56:51] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2024-05-23 02:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:56:51] [INFO ] [Nat]Absence check using 255 positive place invariants in 80 ms returned sat
[2024-05-23 02:56:51] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-23 02:56:53] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2024-05-23 02:56:53] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-23 02:57:06] [INFO ] Added : 126 causal constraints over 26 iterations in 12854 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 23494 reset in 1878 ms.
Product exploration explored 100000 steps with 23000 reset in 1966 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:57:10] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9339 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39384ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39385ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39430 ms. Remains : 514/514 places, 257/257 transitions.
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 7 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:57:49] [INFO ] Invariant cache hit.
[2024-05-23 02:57:50] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 02:57:50] [INFO ] Invariant cache hit.
[2024-05-23 02:57:50] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-23 02:57:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9753 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39789ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39790ms
Finished structural reductions in LTL mode , in 1 iterations and 40525 ms. Remains : 514/514 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 167892 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 (F(G((!p1||X(!p2))))||G(!p3))))'
Found a Lengthening insensitive property : CircularTrains-PT-384-LTLFireability-14
Stuttering acceptance computed with spot in 165 ms :[(AND p1 p2 p3), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2 p3), (AND p1 p2)]
Support contains 8 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 655 transition count 289
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 560 transition count 289
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 190 place count 560 transition count 272
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 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 49 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-23 02:58:30] [INFO ] Computed 272 invariants in 2 ms
[2024-05-23 02:58:31] [INFO ] Implicit Places using invariants in 310 ms returned [12, 63, 79, 238, 250, 286, 297, 343, 423, 466, 515, 521, 526]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 330 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 516/655 places, 258/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 389 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14
Product exploration explored 100000 steps with 418 reset in 1758 ms.
Product exploration explored 100000 steps with 422 reset in 1846 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 (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT p2)), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 27 factoid took 1102 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 1103 steps (0 resets) in 25 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT p2)), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 27 factoid took 1235 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 129 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Support contains 6 out of 516 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-05-23 02:58:37] [INFO ] Computed 259 invariants in 2 ms
[2024-05-23 02:58:37] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-23 02:58:38] [INFO ] Invariant cache hit.
[2024-05-23 02:58:38] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-23 02:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9842 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39879ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39881ms
Finished structural reductions in LTL mode , in 1 iterations and 40681 ms. Remains : 516/516 places, 258/258 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 (NOT p1) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 1626 steps (0 resets) in 55 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 1 factoid took 270 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 135 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 170 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 381 reset in 1673 ms.
Product exploration explored 100000 steps with 399 reset in 1828 ms.
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 15 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-23 02:59:23] [INFO ] Invariant cache hit.
[2024-05-23 02:59:23] [INFO ] Implicit Places using invariants in 301 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/516 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 515 /515 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 515/516 places, 258/258 transitions.
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 52969 ms.
[2024-05-23 02:59:23] [INFO ] Flatten gal took : 24 ms
[2024-05-23 02:59:23] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 02:59:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 655 places, 384 transitions and 1310 arcs took 6 ms.
Total runtime 1307171 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CircularTrains-PT-384

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 655
TRANSITIONS: 384
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.007s]

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

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

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

Process ID: 4918
MODEL NAME: /home/mcc/execution/405/model
655 places, 384 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CircularTrains-PT-384-LTLFireability-00 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-02 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-05 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-07 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-08 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-09 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-10 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716434231557

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CircularTrains-PT-384, 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 r069-tall-171620504400364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-384.tgz
mv CircularTrains-PT-384 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 ;