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.r476-tall-171620505700363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CircularTrains-PT-384, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505700363
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717205317209

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:28:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:28:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:28:38] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 01:28:38] [INFO ] Transformed 768 places.
[2024-06-01 01:28:38] [INFO ] Transformed 384 transitions.
[2024-06-01 01:28:38] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-384-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 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 93 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2024-06-01 01:28:38] [INFO ] Computed 385 invariants in 59 ms
[2024-06-01 01:28:39] [INFO ] Implicit Places using invariants in 832 ms returned [1, 7, 9, 21, 26, 32, 46, 48, 58, 63, 64, 71, 85, 86, 88, 98, 103, 107, 108, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 331, 334, 340, 346, 347, 350, 351, 353, 354, 357, 365, 383, 390, 403, 411, 412, 422, 426, 433, 447, 448, 449, 470, 475, 476, 485, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 576, 579, 580, 586, 600, 607, 619, 622, 625, 638, 643, 644, 647, 648, 662, 666, 671, 674, 677, 689, 693, 700, 708, 715, 718, 719, 723, 732, 735, 740, 741, 743, 746, 747, 749, 755, 758, 759, 760, 763, 764]
Discarding 122 places :
Implicit Place search using SMT only with invariants took 871 ms to find 122 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/768 places, 384/384 transitions.
Applied a total of 0 rules in 39 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1021 ms. Remains : 646/768 places, 384/384 transitions.
Support contains 37 out of 646 places after structural reductions.
[2024-06-01 01:28:40] [INFO ] Flatten gal took : 57 ms
[2024-06-01 01:28:40] [INFO ] Flatten gal took : 30 ms
[2024-06-01 01:28:40] [INFO ] Input system was already deterministic with 384 transitions.
RANDOM walk for 40000 steps (8 resets) in 2182 ms. (18 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
// Phase 1: matrix 384 rows 646 cols
[2024-06-01 01:28:41] [INFO ] Computed 263 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/21 variables, 3/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 300/321 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 642/1030 variables, and 259 constraints, problems are : Problem set: 5 solved, 0 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 256/257 constraints, Generalized P Invariants (flows): 3/6 constraints, State Equation: 0/646 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-384-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-384-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 646 transition count 269
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 230 place count 531 transition count 263
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 87 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-06-01 01:28:41] [INFO ] Computed 263 invariants in 8 ms
[2024-06-01 01:28:42] [INFO ] Implicit Places using invariants in 314 ms returned [12, 80, 155, 280, 428]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 316 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/646 places, 257/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 419 ms. Remains : 514/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-00
Product exploration explored 100000 steps with 1034 reset in 1856 ms.
Product exploration explored 100000 steps with 994 reset in 1827 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 156 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)]
RANDOM walk for 500 steps (0 resets) in 21 ms. (22 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 157 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 28 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 514 cols
[2024-06-01 01:28:46] [INFO ] Computed 258 invariants in 7 ms
[2024-06-01 01:28:46] [INFO ] [Real]Absence check using 256 positive place invariants in 74 ms returned sat
[2024-06-01 01:28:46] [INFO ] [Real]Absence check using 256 positive and 2 generalized place invariants in 18 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLCardinality-00 finished in 5314 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 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 532 transition count 270
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 228 place count 532 transition count 263
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 47 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-06-01 01:28:47] [INFO ] Computed 263 invariants in 4 ms
[2024-06-01 01:28:47] [INFO ] Implicit Places using invariants in 299 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 300 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 22 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-02
Product exploration explored 100000 steps with 552 reset in 1550 ms.
Product exploration explored 100000 steps with 479 reset in 1647 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 174 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 37 ms :[(NOT p0)]
RANDOM walk for 437 steps (0 resets) in 23 ms. (18 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 167 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-06-01 01:28:51] [INFO ] Computed 257 invariants in 7 ms
[2024-06-01 01:28:51] [INFO ] [Real]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-06-01 01:28:51] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 12 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLCardinality-02 finished in 4625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p0))))))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 646 transition count 269
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 230 place count 531 transition count 262
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 244 place count 524 transition count 262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 256 place count 518 transition count 256
Applied a total of 256 rules in 39 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-06-01 01:28:51] [INFO ] Computed 263 invariants in 2 ms
[2024-06-01 01:28:52] [INFO ] Implicit Places using invariants in 300 ms returned [12, 33, 79, 279, 427]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 302 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 256/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 513/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-03
Product exploration explored 100000 steps with 1136 reset in 1670 ms.
Product exploration explored 100000 steps with 1119 reset in 1791 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 161 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 37 ms :[(NOT p0)]
RANDOM walk for 219 steps (0 resets) in 12 ms. (16 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 156 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 256 rows 513 cols
[2024-06-01 01:28:56] [INFO ] Computed 258 invariants in 7 ms
[2024-06-01 01:28:56] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-06-01 01:28:56] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 32 ms returned sat
[2024-06-01 01:28:57] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2024-06-01 01:28:57] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 01:29:11] [INFO ] Added : 110 causal constraints over 22 iterations in 13852 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 256/256 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:29:11] [INFO ] Invariant cache hit.
[2024-06-01 01:29:11] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 01:29:11] [INFO ] Invariant cache hit.
[2024-06-01 01:29:11] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-06-01 01:29:11] [INFO ] Redundant transitions in 13 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:29:11] [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) 2/513 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/769 variables, 513/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/769 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 771 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8233 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 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) 2/513 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/769 variables, 513/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 128/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/769 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 899 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38276ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38974 ms. Remains : 513/513 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 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 40 ms :[(NOT p0)]
RANDOM walk for 243 steps (0 resets) in 11 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 176 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 01:29:50] [INFO ] Invariant cache hit.
[2024-06-01 01:29:50] [INFO ] [Real]Absence check using 255 positive place invariants in 67 ms returned sat
[2024-06-01 01:29:50] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 20 ms returned sat
[2024-06-01 01:29:51] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2024-06-01 01:29:51] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 01:30:05] [INFO ] Added : 120 causal constraints over 24 iterations in 13850 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 1054 reset in 1654 ms.
Product exploration explored 100000 steps with 1170 reset in 1804 ms.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 256/256 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:30:09] [INFO ] Invariant cache hit.
[2024-06-01 01:30:09] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 01:30:09] [INFO ] Invariant cache hit.
[2024-06-01 01:30:09] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2024-06-01 01:30:09] [INFO ] Redundant transitions in 3 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:30:09] [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) 2/513 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/769 variables, 513/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/769 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 771 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 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) 2/513 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/769 variables, 513/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 128/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/769 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 899 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38040ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38750 ms. Remains : 513/513 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-03 finished in 116277 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)))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 532 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 230 place count 531 transition count 263
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 28 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-06-01 01:30:48] [INFO ] Computed 263 invariants in 4 ms
[2024-06-01 01:30:48] [INFO ] Implicit Places using invariants in 299 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 301 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 1256 ms.
Product exploration explored 100000 steps with 0 reset in 1438 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 p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 1245 steps (0 resets) in 45 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-06-01 01:30:51] [INFO ] Computed 257 invariants in 5 ms
[2024-06-01 01:30:51] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-06-01 01:30:51] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 31 ms returned sat
[2024-06-01 01:30:52] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2024-06-01 01:30:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:30:52] [INFO ] [Nat]Absence check using 255 positive place invariants in 69 ms returned sat
[2024-06-01 01:30:52] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 22 ms returned sat
[2024-06-01 01:30:53] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2024-06-01 01:30:53] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 01:31:06] [INFO ] Added : 126 causal constraints over 26 iterations in 12181 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:31:06] [INFO ] Invariant cache hit.
[2024-06-01 01:31:06] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 01:31:06] [INFO ] Invariant cache hit.
[2024-06-01 01:31:06] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-06-01 01:31:06] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:31:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8199 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38229ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38231ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38923 ms. Remains : 513/513 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), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 1428 steps (0 resets) in 43 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-06-01 01:31:45] [INFO ] Invariant cache hit.
[2024-06-01 01:31:45] [INFO ] [Real]Absence check using 255 positive place invariants in 71 ms returned sat
[2024-06-01 01:31:45] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 19 ms returned sat
[2024-06-01 01:31:46] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2024-06-01 01:31:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:31:46] [INFO ] [Nat]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-06-01 01:31:46] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 8 ms returned sat
[2024-06-01 01:31:47] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2024-06-01 01:31:47] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 01:31:59] [INFO ] Added : 126 causal constraints over 26 iterations in 11409 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1275 ms.
Product exploration explored 100000 steps with 0 reset in 1448 ms.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:32:01] [INFO ] Invariant cache hit.
[2024-06-01 01:32:02] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 01:32:02] [INFO ] Invariant cache hit.
[2024-06-01 01:32:02] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-06-01 01:32:02] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:32:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8285 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38316ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39005 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-04 finished in 112830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 532 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 230 place count 531 transition count 262
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 244 place count 524 transition count 262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 256 place count 518 transition count 256
Applied a total of 256 rules in 33 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-06-01 01:32:40] [INFO ] Computed 263 invariants in 2 ms
[2024-06-01 01:32:41] [INFO ] Implicit Places using invariants in 283 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 284 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/646 places, 256/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 335 ms. Remains : 512/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-05
Product exploration explored 100000 steps with 1768 reset in 1759 ms.
Product exploration explored 100000 steps with 1669 reset in 1905 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 180 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 141 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 274 steps (0 resets) in 14 ms. (18 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 183 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 256 rows 512 cols
[2024-06-01 01:32:45] [INFO ] Computed 257 invariants in 3 ms
[2024-06-01 01:32:45] [INFO ] [Real]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-06-01 01:32:45] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 20 ms returned sat
[2024-06-01 01:32:46] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2024-06-01 01:32:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:32:47] [INFO ] [Nat]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-06-01 01:32:47] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-01 01:32:53] [INFO ] [Nat]Absence check using state equation in 6521 ms returned sat
[2024-06-01 01:32:53] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 01:33:01] [INFO ] Added : 125 causal constraints over 25 iterations in 8235 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 21 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:33:01] [INFO ] Invariant cache hit.
[2024-06-01 01:33:02] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 01:33:02] [INFO ] Invariant cache hit.
[2024-06-01 01:33:02] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2024-06-01 01:33:02] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:33:02] [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 8302 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
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30019 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 38336ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39018 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 117 steps (0 resets) in 10 ms. (10 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 170 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:33:41] [INFO ] Invariant cache hit.
[2024-06-01 01:33:41] [INFO ] [Real]Absence check using 255 positive place invariants in 71 ms returned sat
[2024-06-01 01:33:41] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-06-01 01:33:42] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2024-06-01 01:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:33:43] [INFO ] [Nat]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-06-01 01:33:43] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-06-01 01:33:44] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2024-06-01 01:33:44] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 01:33:57] [INFO ] Added : 95 causal constraints over 19 iterations in 13877 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1732 reset in 1778 ms.
Product exploration explored 100000 steps with 1736 reset in 1893 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 10 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:34:01] [INFO ] Invariant cache hit.
[2024-06-01 01:34:01] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 01:34:01] [INFO ] Invariant cache hit.
[2024-06-01 01:34:02] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-06-01 01:34:02] [INFO ] Redundant transitions in 3 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:34:02] [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 8122 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
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30016 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 38154ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38810 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-05 finished in 119640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 532 transition count 270
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 228 place count 532 transition count 262
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 244 place count 524 transition count 262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 256 place count 518 transition count 256
Applied a total of 256 rules in 25 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-06-01 01:34:40] [INFO ] Computed 263 invariants in 3 ms
[2024-06-01 01:34:40] [INFO ] Implicit Places using invariants in 285 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 286 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/646 places, 256/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 321 ms. Remains : 512/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-06
Product exploration explored 100000 steps with 452 reset in 1540 ms.
Product exploration explored 100000 steps with 444 reset in 1658 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 187 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 387 steps (0 resets) in 17 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 174 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (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 14 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2024-06-01 01:34:44] [INFO ] Computed 257 invariants in 4 ms
[2024-06-01 01:34:45] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 01:34:45] [INFO ] Invariant cache hit.
[2024-06-01 01:34:45] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-06-01 01:34:45] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:34:45] [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 8004 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
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, 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 38029ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38693 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 229 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 511 steps (0 resets) in 18 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 172 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 443 reset in 1532 ms.
Product exploration explored 100000 steps with 461 reset in 1681 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 10 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-01 01:35:27] [INFO ] Invariant cache hit.
[2024-06-01 01:35:27] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 01:35:27] [INFO ] Invariant cache hit.
[2024-06-01 01:35:28] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-06-01 01:35:28] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 01:35:28] [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 7946 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
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30015 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 37975ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 37976ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38647 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-06 finished in 85723 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(p1))&&X(G(p2)))))'
Support contains 5 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-06-01 01:36:06] [INFO ] Computed 263 invariants in 7 ms
[2024-06-01 01:36:06] [INFO ] Implicit Places using invariants in 311 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 313 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 8 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 330 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 200 steps with 0 reset in 6 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-08 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:36:06] [INFO ] Invariant cache hit.
[2024-06-01 01:36:07] [INFO ] Implicit Places using invariants in 305 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 306 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 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 328 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-09
Product exploration explored 100000 steps with 1793 reset in 1831 ms.
Product exploration explored 100000 steps with 1839 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 209 steps (0 resets) in 9 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 198 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)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 384 rows 640 cols
[2024-06-01 01:36:11] [INFO ] Computed 257 invariants in 3 ms
[2024-06-01 01:36:12] [INFO ] [Real]Absence check using 255 positive place invariants in 81 ms returned sat
[2024-06-01 01:36:12] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 19 ms returned sat
[2024-06-01 01:36:13] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2024-06-01 01:36:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:36:13] [INFO ] [Nat]Absence check using 255 positive place invariants in 83 ms returned sat
[2024-06-01 01:36:13] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 29 ms returned sat
[2024-06-01 01:36:19] [INFO ] [Nat]Absence check using state equation in 6391 ms returned sat
[2024-06-01 01:36:20] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 01:36:28] [INFO ] Added : 65 causal constraints over 13 iterations in 8268 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 5 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 640 transition count 261
Reduce places removed 123 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 125 rules applied. Total rules applied 248 place count 517 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 250 place count 515 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 250 place count 515 transition count 257
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 513 transition count 257
Applied a total of 254 rules in 34 ms. Remains 513 /640 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 513 cols
[2024-06-01 01:36:28] [INFO ] Computed 257 invariants in 2 ms
[2024-06-01 01:36:28] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 01:36:28] [INFO ] Invariant cache hit.
[2024-06-01 01:36:28] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-06-01 01:36:28] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:36:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8219 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38242ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 513/640 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38937 ms. Remains : 513/640 places, 257/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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 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)]
RANDOM walk for 162 steps (0 resets) in 10 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 127 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:37:07] [INFO ] Invariant cache hit.
[2024-06-01 01:37:08] [INFO ] [Real]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-06-01 01:37:08] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 16 ms returned sat
[2024-06-01 01:37:09] [INFO ] [Real]Absence check using state equation in 1484 ms returned sat
[2024-06-01 01:37:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:37:09] [INFO ] [Nat]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-06-01 01:37:09] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-06-01 01:37:11] [INFO ] [Nat]Absence check using state equation in 1894 ms returned sat
[2024-06-01 01:37:11] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 01:37:17] [INFO ] Added : 127 causal constraints over 26 iterations in 5987 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2551 reset in 1873 ms.
Product exploration explored 100000 steps with 2619 reset in 2016 ms.
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:37:21] [INFO ] Invariant cache hit.
[2024-06-01 01:37:21] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 01:37:21] [INFO ] Invariant cache hit.
[2024-06-01 01:37:22] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-01 01:37:22] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:37:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8184 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38211ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38891 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 113803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-06-01 01:38:00] [INFO ] Computed 263 invariants in 4 ms
[2024-06-01 01:38:00] [INFO ] Implicit Places using invariants in 312 ms returned [14, 36, 90, 188, 538]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 313 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/646 places, 384/384 transitions.
Applied a total of 0 rules in 8 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 334 ms. Remains : 641/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-10 finished in 484 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&&X(X(F(p1))))))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:38:01] [INFO ] Invariant cache hit.
[2024-06-01 01:38:01] [INFO ] Implicit Places using invariants in 316 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 316 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 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 336 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-11
Product exploration explored 100000 steps with 24492 reset in 1714 ms.
Product exploration explored 100000 steps with 24927 reset in 1853 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 p0), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 729 steps (0 resets) in 22 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 640 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-06-01 01:38:05] [INFO ] Computed 257 invariants in 3 ms
[2024-06-01 01:38:06] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 01:38:06] [INFO ] Invariant cache hit.
[2024-06-01 01:38:06] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:38:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 897 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20724 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 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/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 256/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1153 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 50770ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 50772ms
Finished structural reductions in LTL mode , in 1 iterations and 51512 ms. Remains : 640/640 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 719 steps (0 resets) in 28 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24814 reset in 1731 ms.
Product exploration explored 100000 steps with 24736 reset in 1842 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 640 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 127 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Applied a total of 128 rules in 60 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 01:39:02] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-06-01 01:39:02] [INFO ] Computed 257 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 12 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 2 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 2 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:39:05] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:39:06] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:39:06] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:39:06] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:39:06] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:39:06] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 20/276 constraints. Problems are: Problem set: 20 solved, 236 unsolved
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 2 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-06-01 01:39:08] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 4 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 20/296 constraints. Problems are: Problem set: 40 solved, 216 unsolved
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:39:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD126 is UNSAT
[2024-06-01 01:39:10] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-06-01 01:39:10] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 2 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:39:11] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 20/316 constraints. Problems are: Problem set: 59 solved, 197 unsolved
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:39:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 01:39:13] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 2 ms to minimize.
[2024-06-01 01:39:13] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:39:13] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-06-01 01:39:13] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 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 TDEAD51 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 20/336 constraints. Problems are: Problem set: 79 solved, 177 unsolved
[2024-06-01 01:39:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 01:39:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:39:15] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 01:39:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:39:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 20/356 constraints. Problems are: Problem set: 98 solved, 158 unsolved
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:39:17] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-06-01 01:39:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 01:39:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 01:39:18] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-06-01 01:39:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD199 is UNSAT
[2024-06-01 01:39:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 13/369 constraints. Problems are: Problem set: 111 solved, 145 unsolved
[2024-06-01 01:39:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 01:39:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 01:39:19] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:39:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:39:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:39:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:39:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:39:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:39:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 9/378 constraints. Problems are: Problem set: 120 solved, 136 unsolved
[2024-06-01 01:39:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 01:39:22] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:39:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:39:23] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 4/382 constraints. Problems are: Problem set: 124 solved, 132 unsolved
[2024-06-01 01:39:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 1/383 constraints. Problems are: Problem set: 124 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/383 constraints. Problems are: Problem set: 124 solved, 132 unsolved
At refinement iteration 13 (OVERLAPS) 1/640 variables, 1/384 constraints. Problems are: Problem set: 124 solved, 132 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 0/384 constraints. Problems are: Problem set: 124 solved, 132 unsolved
Problem TDEAD96 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 15 (OVERLAPS) 384/1024 variables, 640/1024 constraints. Problems are: Problem set: 128 solved, 128 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 1024 constraints, problems are : Problem set: 128 solved, 128 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 127/127 constraints]
Escalating to Integer solving :Problem set: 128 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 383/639 variables, 255/255 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 127/383 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/383 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 1/640 variables, 1/384 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 0/384 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 384/1024 variables, 640/1024 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 128/1152 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1024 variables, 0/1152 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/1024 variables, 0/1152 constraints. Problems are: Problem set: 128 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1152 constraints, problems are : Problem set: 128 solved, 128 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 128/256 constraints, Known Traps: 127/127 constraints]
After SMT, in 60054ms problems are : Problem set: 128 solved, 128 unsolved
Search for dead transitions found 128 dead transitions in 60057ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 640/640 places, 256/384 transitions.
Graph (complete) has 1024 edges and 640 vertex of which 512 are kept as prefixes of interest. Removing 128 places using SCC suffix rule.2 ms
Discarding 128 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 512 /640 variables (removed 128) and now considering 256/256 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/640 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60142 ms. Remains : 512/640 places, 256/384 transitions.
Support contains 1 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-06-01 01:40:02] [INFO ] Computed 257 invariants in 9 ms
[2024-06-01 01:40:02] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-06-01 01:40:02] [INFO ] Invariant cache hit.
[2024-06-01 01:40:02] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 01:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 897 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20761 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 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/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 256/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1153 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 50808ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 50811ms
Finished structural reductions in LTL mode , in 1 iterations and 51579 ms. Remains : 640/640 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-11 finished in 172662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 4 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-06-01 01:40:53] [INFO ] Computed 263 invariants in 7 ms
[2024-06-01 01:40:54] [INFO ] Implicit Places using invariants in 319 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 320 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 10 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 346 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-12 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 646 transition count 269
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 230 place count 531 transition count 263
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 22 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-06-01 01:40:54] [INFO ] Computed 263 invariants in 5 ms
[2024-06-01 01:40:54] [INFO ] Implicit Places using invariants in 307 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 308 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-13
Product exploration explored 100000 steps with 1029 reset in 1728 ms.
Product exploration explored 100000 steps with 1012 reset in 1880 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 142 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 285 steps (0 resets) in 16 ms. (16 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 190 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-06-01 01:40:59] [INFO ] Computed 257 invariants in 2 ms
[2024-06-01 01:40:59] [INFO ] [Real]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-06-01 01:40:59] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 18 ms returned sat
[2024-06-01 01:40:59] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-06-01 01:40:59] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 01:41:14] [INFO ] Added : 90 causal constraints over 18 iterations in 14572 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:41:14] [INFO ] Invariant cache hit.
[2024-06-01 01:41:14] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 01:41:14] [INFO ] Invariant cache hit.
[2024-06-01 01:41:14] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-06-01 01:41:14] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:41:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8500 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38523ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39215 ms. Remains : 513/513 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 192 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 8 ms. (18 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 218 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:41:54] [INFO ] Invariant cache hit.
[2024-06-01 01:41:54] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-06-01 01:41:54] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 32 ms returned sat
[2024-06-01 01:41:55] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2024-06-01 01:41:55] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 01:42:09] [INFO ] Added : 126 causal constraints over 26 iterations in 13816 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1054 reset in 1695 ms.
Product exploration explored 100000 steps with 1022 reset in 1834 ms.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:42:12] [INFO ] Invariant cache hit.
[2024-06-01 01:42:12] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 01:42:12] [INFO ] Invariant cache hit.
[2024-06-01 01:42:13] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-06-01 01:42:13] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8472 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38495ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38497ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39191 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-13 finished in 117512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(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)))'
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' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLCardinality-09
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 646 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 646 transition count 273
Reduce places removed 111 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 113 rules applied. Total rules applied 224 place count 535 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 226 place count 533 transition count 271
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 226 place count 533 transition count 263
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 28 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-06-01 01:42:52] [INFO ] Computed 263 invariants in 6 ms
[2024-06-01 01:42:52] [INFO ] Implicit Places using invariants in 274 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 276 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 311 ms. Remains : 513/646 places, 257/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-09
Product exploration explored 100000 steps with 2594 reset in 1835 ms.
Product exploration explored 100000 steps with 2623 reset in 1973 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 195 steps (0 resets) in 13 ms. (13 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 200 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-06-01 01:42:57] [INFO ] Computed 257 invariants in 6 ms
[2024-06-01 01:42:57] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-06-01 01:42:57] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 12 ms returned sat
[2024-06-01 01:42:58] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2024-06-01 01:42:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:42:58] [INFO ] [Nat]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-06-01 01:42:58] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 17 ms returned sat
[2024-06-01 01:42:59] [INFO ] [Nat]Absence check using state equation in 895 ms returned sat
[2024-06-01 01:42:59] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 01:43:13] [INFO ] Added : 126 causal constraints over 26 iterations in 13857 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:43:13] [INFO ] Invariant cache hit.
[2024-06-01 01:43:13] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-06-01 01:43:13] [INFO ] Invariant cache hit.
[2024-06-01 01:43:13] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-06-01 01:43:13] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:43:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8157 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38180ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38837 ms. Remains : 513/513 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 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 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 76 steps (0 resets) in 7 ms. (9 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 214 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:43:52] [INFO ] Invariant cache hit.
[2024-06-01 01:43:52] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-06-01 01:43:52] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 20 ms returned sat
[2024-06-01 01:43:54] [INFO ] [Real]Absence check using state equation in 1692 ms returned sat
[2024-06-01 01:43:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:43:54] [INFO ] [Nat]Absence check using 255 positive place invariants in 75 ms returned sat
[2024-06-01 01:43:54] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-06-01 01:43:56] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2024-06-01 01:43:56] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 01:44:05] [INFO ] Added : 126 causal constraints over 26 iterations in 8864 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2623 reset in 1899 ms.
Product exploration explored 100000 steps with 2566 reset in 2019 ms.
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-06-01 01:44:09] [INFO ] Invariant cache hit.
[2024-06-01 01:44:09] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 01:44:09] [INFO ] Invariant cache hit.
[2024-06-01 01:44:09] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-06-01 01:44:09] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 01:44:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8419 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/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) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 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): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38444ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38445ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39121 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 115899 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&&X(X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 01:44:48] [INFO ] Flatten gal took : 23 ms
[2024-06-01 01:44:48] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 01:44:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 646 places, 384 transitions and 1292 arcs took 7 ms.
Total runtime 970077 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CircularTrains-PT-384-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-384-LTLCardinality-05
Could not compute solution for formula : CircularTrains-PT-384-LTLCardinality-06
Could not compute solution for formula : CircularTrains-PT-384-LTLCardinality-09
Could not compute solution for formula : CircularTrains-PT-384-LTLCardinality-11
Could not compute solution for formula : CircularTrains-PT-384-LTLCardinality-13

BK_STOP 1717206643630

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-384-LTLCardinality-03
ltl formula formula --ltl=/tmp/2558/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 385 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1717 levels ~10000 states ~233372 transitions
pnml2lts-mc( 1/ 4): ~3324 levels ~20000 states ~291308 transitions
pnml2lts-mc( 1/ 4): ~6439 levels ~40000 states ~373876 transitions
pnml2lts-mc( 2/ 4): ~12052 levels ~80000 states ~503292 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~12488!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28803
pnml2lts-mc( 0/ 4): unique states count: 78222
pnml2lts-mc( 0/ 4): unique transitions count: 535846
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 78225
pnml2lts-mc( 0/ 4): - cum. max stack depth: 49422
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 78225 states 536234 transitions, fanout: 6.855
pnml2lts-mc( 0/ 4): Total exploration time 1.660 sec (1.660 sec minimum, 1.660 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47123, Transitions per second: 323033
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 18.3MB, 35.8 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 18.3MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLCardinality-04
ltl formula formula --ltl=/tmp/2558/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 647 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 388 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~262612 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~321560 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~399068 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~12514!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 45450
pnml2lts-mc( 0/ 4): unique transitions count: 459557
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 45453
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45453
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45453 states 459945 transitions, fanout: 10.119
pnml2lts-mc( 0/ 4): Total exploration time 1.190 sec (1.190 sec minimum, 1.190 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38196, Transitions per second: 386508
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 15.8MB, 36.1 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 15.8MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLCardinality-05
ltl formula formula --ltl=/tmp/2558/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1085 levels ~10000 states ~203016 transitions
pnml2lts-mc( 2/ 4): ~2052 levels ~20000 states ~260584 transitions
pnml2lts-mc( 2/ 4): ~3965 levels ~40000 states ~327024 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~80000 states ~419984 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~160000 states ~572272 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~320000 states ~898572 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~640000 states ~1551284 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~1280000 states ~3017640 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~2560000 states ~5878628 transitions
pnml2lts-mc( 0/ 4): ~6079 levels ~5120000 states ~12155652 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6530587
pnml2lts-mc( 0/ 4): unique states count: 6554463
pnml2lts-mc( 0/ 4): unique transitions count: 14500215
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9446044
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7030961
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24307
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7030961 states 17107747 transitions, fanout: 2.433
pnml2lts-mc( 0/ 4): Total exploration time 75.110 sec (75.090 sec minimum, 75.097 sec on average)
pnml2lts-mc( 0/ 4): States per second: 93609, Transitions per second: 227769
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 116.5MB, 17.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 116.5MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLCardinality-06
ltl formula formula --ltl=/tmp/2558/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1320 levels ~10000 states ~237088 transitions
pnml2lts-mc( 1/ 4): ~2548 levels ~20000 states ~297204 transitions
pnml2lts-mc( 1/ 4): ~5055 levels ~40000 states ~361344 transitions
pnml2lts-mc( 1/ 4): ~7313 levels ~80000 states ~438900 transitions
pnml2lts-mc( 1/ 4): ~7313 levels ~160000 states ~568452 transitions
pnml2lts-mc( 2/ 4): ~9836 levels ~320000 states ~835928 transitions
pnml2lts-mc( 2/ 4): ~9836 levels ~640000 states ~1365016 transitions
pnml2lts-mc( 2/ 4): ~9836 levels ~1280000 states ~2421952 transitions
pnml2lts-mc( 2/ 4): ~9836 levels ~2560000 states ~4548124 transitions
pnml2lts-mc( 2/ 4): ~9836 levels ~5120000 states ~9600396 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7642913
pnml2lts-mc( 0/ 4): unique states count: 7683906
pnml2lts-mc( 0/ 4): unique transitions count: 15762639
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7695167
pnml2lts-mc( 0/ 4): - claim found count: 1518
pnml2lts-mc( 0/ 4): - claim success count: 7683909
pnml2lts-mc( 0/ 4): - cum. max stack depth: 41561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7683909 states 15763025 transitions, fanout: 2.051
pnml2lts-mc( 0/ 4): Total exploration time 79.550 sec (79.530 sec minimum, 79.538 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96592, Transitions per second: 198152
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 125.5MB, 16.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 125.5MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLCardinality-09
ltl formula formula --ltl=/tmp/2558/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1240 levels ~10000 states ~215280 transitions
pnml2lts-mc( 0/ 4): ~2490 levels ~20000 states ~269300 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~40000 states ~320672 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~80000 states ~379164 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~160000 states ~511088 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~320000 states ~771032 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~640000 states ~1348880 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~1280000 states ~2523284 transitions
pnml2lts-mc( 0/ 4): ~4500 levels ~2560000 states ~4889400 transitions
pnml2lts-mc( 2/ 4): ~6822 levels ~5120000 states ~8977564 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6559900
pnml2lts-mc( 0/ 4): unique states count: 6581158
pnml2lts-mc( 0/ 4): unique transitions count: 12640722
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5706349
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6581161
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21626
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6581161 states 12641108 transitions, fanout: 1.921
pnml2lts-mc( 0/ 4): Total exploration time 69.780 sec (69.760 sec minimum, 69.772 sec on average)
pnml2lts-mc( 0/ 4): States per second: 94313, Transitions per second: 181157
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 116.6MB, 17.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 116.6MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLCardinality-11
ltl formula formula --ltl=/tmp/2558/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 390 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~4 levels ~10000 states ~12292 transitions
pnml2lts-mc( 1/ 4): ~4 levels ~20000 states ~25604 transitions
pnml2lts-mc( 1/ 4): ~1697 levels ~40000 states ~283944 transitions
pnml2lts-mc( 1/ 4): ~6981 levels ~80000 states ~437324 transitions
pnml2lts-mc( 1/ 4): ~12364 levels ~160000 states ~595404 transitions
pnml2lts-mc( 1/ 4): ~12364 levels ~320000 states ~927796 transitions
pnml2lts-mc( 1/ 4): ~12364 levels ~640000 states ~1592484 transitions
pnml2lts-mc( 0/ 4): ~12414 levels ~1280000 states ~2857528 transitions
pnml2lts-mc( 0/ 4): ~12414 levels ~2560000 states ~5389960 transitions
pnml2lts-mc( 0/ 4): ~12414 levels ~5120000 states ~11352500 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5606806
pnml2lts-mc( 0/ 4): unique states count: 5655879
pnml2lts-mc( 0/ 4): unique transitions count: 13885353
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 10160365
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6356401
pnml2lts-mc( 0/ 4): - cum. max stack depth: 49607
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6356401 states 17165658 transitions, fanout: 2.701
pnml2lts-mc( 0/ 4): Total exploration time 66.060 sec (66.050 sec minimum, 66.055 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96222, Transitions per second: 259850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 110.1MB, 19.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 110.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-384-LTLCardinality-13
ltl formula formula --ltl=/tmp/2558/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 646 places, 384 transitions and 1292 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2558/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2558/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2558/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2558/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 648 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 647, there are 387 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1492 levels ~10000 states ~230092 transitions
pnml2lts-mc( 2/ 4): ~2973 levels ~20000 states ~300696 transitions
pnml2lts-mc( 2/ 4): ~5897 levels ~40000 states ~362520 transitions
pnml2lts-mc( 2/ 4): ~11803 levels ~80000 states ~453272 transitions
pnml2lts-mc( 2/ 4): ~12220 levels ~160000 states ~572548 transitions
pnml2lts-mc( 2/ 4): ~12220 levels ~320000 states ~888796 transitions
pnml2lts-mc( 2/ 4): ~12220 levels ~640000 states ~1524180 transitions
pnml2lts-mc( 2/ 4): ~12220 levels ~1280000 states ~2794580 transitions
pnml2lts-mc( 2/ 4): ~12220 levels ~2560000 states ~5333104 transitions
pnml2lts-mc( 2/ 4): ~12220 levels ~5120000 states ~10813780 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5757928
pnml2lts-mc( 0/ 4): unique states count: 5806293
pnml2lts-mc( 0/ 4): unique transitions count: 14683146
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8462393
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5806296
pnml2lts-mc( 0/ 4): - cum. max stack depth: 48822
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5806296 states 14683916 transitions, fanout: 2.529
pnml2lts-mc( 0/ 4): Total exploration time 58.750 sec (58.740 sec minimum, 58.743 sec on average)
pnml2lts-mc( 0/ 4): States per second: 98831, Transitions per second: 249939
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 111.5MB, 18.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 387 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 111.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-384"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-384, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505700363"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;