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.r070-tall-171620505700364.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 itstools
Input is CircularTrains-PT-384, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716287544184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 10:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 10:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:32:25] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-21 10:32:25] [INFO ] Transformed 768 places.
[2024-05-21 10:32:25] [INFO ] Transformed 384 transitions.
[2024-05-21 10:32:25] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 88 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2024-05-21 10:32:25] [INFO ] Computed 385 invariants in 55 ms
[2024-05-21 10:32:26] [INFO ] Implicit Places using invariants in 796 ms returned [1, 7, 9, 21, 26, 32, 42, 46, 48, 58, 63, 64, 71, 86, 88, 98, 103, 107, 108, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 221, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 340, 346, 347, 350, 353, 354, 357, 365, 383, 390, 397, 411, 412, 426, 433, 447, 448, 449, 470, 475, 476, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 579, 580, 586, 600, 619, 622, 625, 628, 638, 643, 644, 647, 648, 662, 666, 671, 674, 689, 693, 700, 708, 715, 718, 719, 723, 732, 735, 740, 741, 746, 747, 749, 758, 759, 760, 763]
Discarding 113 places :
Implicit Place search using SMT only with invariants took 839 ms to find 113 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 655/768 places, 384/384 transitions.
Applied a total of 0 rules in 36 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 979 ms. Remains : 655/768 places, 384/384 transitions.
Support contains 54 out of 655 places after structural reductions.
[2024-05-21 10:32:26] [INFO ] Flatten gal took : 72 ms
[2024-05-21 10:32:26] [INFO ] Flatten gal took : 35 ms
[2024-05-21 10:32:27] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 48 out of 655 places (down from 54) after GAL structural reductions.
RANDOM walk for 2098 steps (0 resets) in 448 ms. (4 steps per ms) remains 0/24 properties
FORMULA CircularTrains-PT-384-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 82 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-21 10:32:27] [INFO ] Computed 272 invariants in 10 ms
[2024-05-21 10:32:28] [INFO ] Implicit Places using invariants in 566 ms returned [12, 63, 79, 238, 241, 250, 285, 296, 342, 400, 423, 466, 515, 521]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 567 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 35 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-21 10:32:28] [INFO ] Computed 258 invariants in 4 ms
[2024-05-21 10:32:28] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-21 10:32:28] [INFO ] Invariant cache hit.
[2024-05-21 10:32:29] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1468 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-00
Product exploration explored 100000 steps with 1018 reset in 1825 ms.
Product exploration explored 100000 steps with 1044 reset in 1833 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 274 steps (0 resets) in 15 ms. (17 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 150 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:32:33] [INFO ] Invariant cache hit.
[2024-05-21 10:32:33] [INFO ] [Real]Absence check using 254 positive place invariants in 71 ms returned sat
[2024-05-21 10:32:33] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 28 ms returned sat
[2024-05-21 10:32:34] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2024-05-21 10:32:34] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 10:32:48] [INFO ] Added : 126 causal constraints over 26 iterations in 13813 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:32:48] [INFO ] Invariant cache hit.
[2024-05-21 10:32:49] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-21 10:32:49] [INFO ] Invariant cache hit.
[2024-05-21 10:32:49] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2024-05-21 10:32:49] [INFO ] Redundant transitions in 17 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:32:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8575 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/512 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/514 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 254/254 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38645ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39391 ms. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 137 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 736 steps (0 resets) in 29 ms. (24 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 181 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:33:28] [INFO ] Invariant cache hit.
[2024-05-21 10:33:29] [INFO ] [Real]Absence check using 254 positive place invariants in 66 ms returned sat
[2024-05-21 10:33:29] [INFO ] [Real]Absence check using 254 positive and 4 generalized place invariants in 31 ms returned sat
[2024-05-21 10:33:29] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2024-05-21 10:33:29] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-21 10:33:43] [INFO ] Added : 126 causal constraints over 26 iterations in 13902 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1019 reset in 1662 ms.
Product exploration explored 100000 steps with 1045 reset in 1799 ms.
Built C files in :
/tmp/ltsmin16349335973454661888
[2024-05-21 10:33:47] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:33:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:33:47] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:33:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:33:47] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:33:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:33:47] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16349335973454661888
Running compilation step : cd /tmp/ltsmin16349335973454661888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin16349335973454661888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16349335973454661888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5466334644480020815.hoa' '--buchi-type=spotba'
LTSmin run took 3478 ms.
FORMULA CircularTrains-PT-384-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-00 finished in 84096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-21 10:33:51] [INFO ] Computed 272 invariants in 12 ms
[2024-05-21 10:33:52] [INFO ] Implicit Places using invariants in 362 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 583, 637, 646, 651]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 365 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/655 places, 384/384 transitions.
Applied a total of 0 rules in 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 392 ms. Remains : 640/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-384-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-01 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 19 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:33:52] [INFO ] Invariant cache hit.
[2024-05-21 10:33:52] [INFO ] Implicit Places using invariants in 332 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 637, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 333 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 362 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 806 reset in 1762 ms.
Product exploration explored 100000 steps with 743 reset in 1828 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1041 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 7350 steps (0 resets) in 224 ms. (32 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1515 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2024-05-21 10:33:59] [INFO ] Computed 259 invariants in 7 ms
[2024-05-21 10:33:59] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-21 10:33:59] [INFO ] Invariant cache hit.
[2024-05-21 10:34:00] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:34:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23131 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53184ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53187ms
Finished structural reductions in LTL mode , in 1 iterations and 54038 ms. Remains : 642/642 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1062 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 8519 steps (1 resets) in 194 ms. (43 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1602 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 747 reset in 1767 ms.
Product exploration explored 100000 steps with 748 reset in 1829 ms.
Built C files in :
/tmp/ltsmin8432204356213053027
[2024-05-21 10:35:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8432204356213053027
Running compilation step : cd /tmp/ltsmin8432204356213053027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 779 ms.
Running link step : cd /tmp/ltsmin8432204356213053027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8432204356213053027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15592964290060460814.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:35:15] [INFO ] Invariant cache hit.
[2024-05-21 10:35:16] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-21 10:35:16] [INFO ] Invariant cache hit.
[2024-05-21 10:35:16] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:35:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23300 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53351ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53354ms
Finished structural reductions in LTL mode , in 1 iterations and 54177 ms. Remains : 642/642 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin122788802447319953
[2024-05-21 10:36:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin122788802447319953
Running compilation step : cd /tmp/ltsmin122788802447319953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 807 ms.
Running link step : cd /tmp/ltsmin122788802447319953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin122788802447319953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9563819815935560243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:36:25] [INFO ] Flatten gal took : 23 ms
[2024-05-21 10:36:25] [INFO ] Flatten gal took : 21 ms
[2024-05-21 10:36:25] [INFO ] Time to serialize gal into /tmp/LTL4964877707281153105.gal : 6 ms
[2024-05-21 10:36:25] [INFO ] Time to serialize properties into /tmp/LTL8600519995654497719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4964877707281153105.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1885628364314845779.hoa' '-atoms' '/tmp/LTL8600519995654497719.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8600519995654497719.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1885628364314845779.hoa
Detected timeout of ITS tools.
[2024-05-21 10:36:40] [INFO ] Flatten gal took : 20 ms
[2024-05-21 10:36:40] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:36:40] [INFO ] Time to serialize gal into /tmp/LTL17134263692639438055.gal : 4 ms
[2024-05-21 10:36:40] [INFO ] Time to serialize properties into /tmp/LTL7735136305117661862.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17134263692639438055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7735136305117661862.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Section_34<1)||(F35<1))"))||(X((X(!("((Section_115>=1)&&(F116>=1))")))U((X(G(!("((Section_115>=1)&&(F116>=1))"))))||((!("((...233
Formula 0 simplified : G(F!"((Section_34<1)||(F35<1))" & X(X"((Section_115>=1)&&(F116>=1))" R (XF"((Section_115>=1)&&(F116>=1))" & ("((F112>=1)&&(Section_1...202
Detected timeout of ITS tools.
[2024-05-21 10:36:55] [INFO ] Flatten gal took : 21 ms
[2024-05-21 10:36:55] [INFO ] Applying decomposition
[2024-05-21 10:36:55] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9788763640294884483.txt' '-o' '/tmp/graph9788763640294884483.bin' '-w' '/tmp/graph9788763640294884483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9788763640294884483.bin' '-l' '-1' '-v' '-w' '/tmp/graph9788763640294884483.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:36:55] [INFO ] Decomposing Gal with order
[2024-05-21 10:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:36:55] [INFO ] Flatten gal took : 51 ms
[2024-05-21 10:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 10:36:55] [INFO ] Time to serialize gal into /tmp/LTL3517065037681728258.gal : 6 ms
[2024-05-21 10:36:55] [INFO ] Time to serialize properties into /tmp/LTL13875359297855149809.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3517065037681728258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13875359297855149809.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i12.i1.u54.Section_34<1)||(i12.i1.u36.F35<1))"))||(X((X(!("((i10.i0.u30.Section_115>=1)&&(i10.i0.u1.F116>=1))")))U((X(G(!("...340
Formula 0 simplified : G(F!"((i12.i1.u54.Section_34<1)||(i12.i1.u36.F35<1))" & X(X"((i10.i0.u30.Section_115>=1)&&(i10.i0.u1.F116>=1))" R (XF"((i10.i0.u30.S...309
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 198392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U ((p1 U X(X(X(!p2))))||G(!p0)))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-21 10:37:10] [INFO ] Computed 272 invariants in 5 ms
[2024-05-21 10:37:11] [INFO ] Implicit Places using invariants in 351 ms returned [14, 72, 90, 287, 290, 303, 348, 420, 499, 583, 637, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 352 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 379 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 691 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), p2, (AND p0 p2), (AND p0 p2), p2, true, p2, p2, p2, p2, p2, p2, p2]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-04
Entered a terminal (fully accepting) state of product in 245 steps with 14 reset in 11 ms.
FORMULA CircularTrains-PT-384-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-04 finished in 1111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 47 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-05-21 10:37:11] [INFO ] Computed 272 invariants in 2 ms
[2024-05-21 10:37:12] [INFO ] Implicit Places using invariants in 293 ms returned [12, 63, 79, 239, 242, 286, 297, 401, 424, 467, 516, 522, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 294 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 14 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-05-21 10:37:12] [INFO ] Computed 259 invariants in 7 ms
[2024-05-21 10:37:12] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-21 10:37:12] [INFO ] Invariant cache hit.
[2024-05-21 10:37:12] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1018 ms. Remains : 516/655 places, 258/384 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05
Product exploration explored 100000 steps with 1021 reset in 1661 ms.
Product exploration explored 100000 steps with 1043 reset in 1799 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 352 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 529 steps (0 resets) in 19 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 433 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-05-21 10:37:17] [INFO ] Invariant cache hit.
[2024-05-21 10:37:17] [INFO ] [Real]Absence check using 256 positive place invariants in 71 ms returned sat
[2024-05-21 10:37:17] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 31 ms returned sat
[2024-05-21 10:37:18] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2024-05-21 10:37:18] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-21 10:37:32] [INFO ] Added : 127 causal constraints over 26 iterations in 13781 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 22 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-21 10:37:32] [INFO ] Invariant cache hit.
[2024-05-21 10:37:32] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 10:37:33] [INFO ] Invariant cache hit.
[2024-05-21 10:37:33] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-21 10:37:33] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 10:37:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9306 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39334ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40024 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 306 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 279 steps (0 resets) in 13 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 377 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-05-21 10:38:13] [INFO ] Invariant cache hit.
[2024-05-21 10:38:14] [INFO ] [Real]Absence check using 256 positive place invariants in 66 ms returned sat
[2024-05-21 10:38:14] [INFO ] [Real]Absence check using 256 positive and 3 generalized place invariants in 34 ms returned sat
[2024-05-21 10:38:15] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2024-05-21 10:38:15] [INFO ] Computed and/alt/rep : 130/258/130 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-21 10:38:28] [INFO ] Added : 127 causal constraints over 26 iterations in 13748 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1007 reset in 1645 ms.
Product exploration explored 100000 steps with 1045 reset in 1791 ms.
Built C files in :
/tmp/ltsmin7935752310080180216
[2024-05-21 10:38:32] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-21 10:38:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:38:32] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-21 10:38:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:38:32] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-21 10:38:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:38:32] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7935752310080180216
Running compilation step : cd /tmp/ltsmin7935752310080180216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 648 ms.
Running link step : cd /tmp/ltsmin7935752310080180216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7935752310080180216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4239434408859766861.hoa' '--buchi-type=spotba'
LTSmin run took 8700 ms.
FORMULA CircularTrains-PT-384-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 89953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 198 place count 556 transition count 272
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 36 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-21 10:38:41] [INFO ] Computed 272 invariants in 6 ms
[2024-05-21 10:38:42] [INFO ] Implicit Places using invariants in 312 ms returned [63, 79, 239, 242, 251, 286, 297, 343, 400, 423, 466, 515, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 313 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 14 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-21 10:38:42] [INFO ] Computed 258 invariants in 3 ms
[2024-05-21 10:38:42] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-21 10:38:42] [INFO ] Invariant cache hit.
[2024-05-21 10:38:42] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1030 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-07
Product exploration explored 100000 steps with 1066 reset in 1662 ms.
Product exploration explored 100000 steps with 1035 reset in 1799 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 186 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 118 ms :[(NOT p0)]
RANDOM walk for 368 steps (0 resets) in 20 ms. (17 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 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-21 10:38:47] [INFO ] Invariant cache hit.
[2024-05-21 10:38:47] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-21 10:38:47] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 27 ms returned sat
[2024-05-21 10:38:48] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2024-05-21 10:38:48] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-21 10:39:02] [INFO ] Added : 125 causal constraints over 25 iterations in 13577 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 21 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:39:02] [INFO ] Invariant cache hit.
[2024-05-21 10:39:02] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-21 10:39:02] [INFO ] Invariant cache hit.
[2024-05-21 10:39:02] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-21 10:39:02] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:39:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8154 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38185ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38857 ms. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 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 38 ms :[(NOT p0)]
RANDOM walk for 547 steps (0 resets) in 21 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-21 10:39:41] [INFO ] Invariant cache hit.
[2024-05-21 10:39:41] [INFO ] [Real]Absence check using 255 positive place invariants in 75 ms returned sat
[2024-05-21 10:39:41] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 32 ms returned sat
[2024-05-21 10:39:42] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2024-05-21 10:39:42] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-21 10:39:56] [INFO ] Added : 120 causal constraints over 24 iterations in 13566 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 1084 reset in 1665 ms.
Product exploration explored 100000 steps with 1057 reset in 1813 ms.
Built C files in :
/tmp/ltsmin4933361175664792340
[2024-05-21 10:40:00] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:40:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:40:00] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:40:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:40:00] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:40:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:40:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4933361175664792340
Running compilation step : cd /tmp/ltsmin4933361175664792340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin4933361175664792340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4933361175664792340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8050128405680477476.hoa' '--buchi-type=spotba'
LTSmin run took 3059 ms.
FORMULA CircularTrains-PT-384-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-07 finished in 81979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 655 transition count 285
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 29 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-05-21 10:40:03] [INFO ] Computed 272 invariants in 4 ms
[2024-05-21 10:40:04] [INFO ] Implicit Places using invariants in 291 ms returned [12, 63, 240, 243, 252, 287, 298, 344, 401, 424, 467, 516, 522, 527]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 292 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/655 places, 259/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 516 transition count 258
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 514 transition count 257
Applied a total of 4 rules in 14 ms. Remains 514 /516 variables (removed 2) and now considering 257/259 (removed 2) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-21 10:40:04] [INFO ] Computed 258 invariants in 3 ms
[2024-05-21 10:40:04] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-21 10:40:04] [INFO ] Invariant cache hit.
[2024-05-21 10:40:04] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 965 ms. Remains : 514/655 places, 257/384 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08
Product exploration explored 100000 steps with 558 reset in 1615 ms.
Product exploration explored 100000 steps with 580 reset in 1755 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 363 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 716 ms. (55 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 1/1 properties
[2024-05-21 10:40:09] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/771 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Positive P Invariants (semi-flows): 0/256 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 421 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 15 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:40:09] [INFO ] Invariant cache hit.
[2024-05-21 10:40:09] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 10:40:09] [INFO ] Invariant cache hit.
[2024-05-21 10:40:10] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-21 10:40:10] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:40:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8290 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38316ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39006 ms. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 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 65 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 541 steps (0 resets) in 22 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 207 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 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 562 reset in 1591 ms.
Product exploration explored 100000 steps with 556 reset in 1726 ms.
Built C files in :
/tmp/ltsmin5221673348718757127
[2024-05-21 10:40:52] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:40:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:40:52] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:40:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:40:52] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:40:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:40:52] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5221673348718757127
Running compilation step : cd /tmp/ltsmin5221673348718757127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 635 ms.
Running link step : cd /tmp/ltsmin5221673348718757127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5221673348718757127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13014310156124760068.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:41:07] [INFO ] Invariant cache hit.
[2024-05-21 10:41:08] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 10:41:08] [INFO ] Invariant cache hit.
[2024-05-21 10:41:08] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-21 10:41:08] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:41:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8277 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38307ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38996 ms. Remains : 514/514 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin6593696911724306444
[2024-05-21 10:41:46] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:41:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:41:46] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:41:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:41:46] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:41:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:41:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6593696911724306444
Running compilation step : cd /tmp/ltsmin6593696911724306444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 684 ms.
Running link step : cd /tmp/ltsmin6593696911724306444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6593696911724306444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10836273887355317185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:42:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:42:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:42:01] [INFO ] Time to serialize gal into /tmp/LTL2342800693231057375.gal : 2 ms
[2024-05-21 10:42:01] [INFO ] Time to serialize properties into /tmp/LTL10542394176155549364.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2342800693231057375.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8068083553409832364.hoa' '-atoms' '/tmp/LTL10542394176155549364.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10542394176155549364.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8068083553409832364.hoa
Detected timeout of ITS tools.
[2024-05-21 10:42:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:42:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:42:17] [INFO ] Time to serialize gal into /tmp/LTL8896881743118519894.gal : 2 ms
[2024-05-21 10:42:17] [INFO ] Time to serialize properties into /tmp/LTL17039066934615071603.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8896881743118519894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17039066934615071603.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((F83>=1)&&(Section_82>=1))"))U((G(!("((F83>=1)&&(Section_82>=1))")))||("((!(((F94>=1)&&(Section_93>=1))&&((F83>=1)&&(Secti...207
Formula 0 simplified : FG("((F83>=1)&&(Section_82>=1))" M !"((!(((F94>=1)&&(Section_93>=1))&&((F83>=1)&&(Section_82>=1))))&&(!((F83>=1)&&(Section_82>=1))))...157
Detected timeout of ITS tools.
[2024-05-21 10:42:32] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:42:32] [INFO ] Applying decomposition
[2024-05-21 10:42:32] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15441437542887339311.txt' '-o' '/tmp/graph15441437542887339311.bin' '-w' '/tmp/graph15441437542887339311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15441437542887339311.bin' '-l' '-1' '-v' '-w' '/tmp/graph15441437542887339311.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:42:32] [INFO ] Decomposing Gal with order
[2024-05-21 10:42:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:42:32] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:42:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 10:42:32] [INFO ] Time to serialize gal into /tmp/LTL17189170827663311047.gal : 9 ms
[2024-05-21 10:42:32] [INFO ] Time to serialize properties into /tmp/LTL17633102961037623100.ltl : 63 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17189170827663311047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17633102961037623100.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i18.i0.i0.u114.F83>=1)&&(i18.i0.i0.u114.Section_82>=1))"))U((G(!("((i18.i0.i0.u114.F83>=1)&&(i18.i0.i0.u114.Section_82>=1...342
Formula 0 simplified : FG("((i18.i0.i0.u114.F83>=1)&&(i18.i0.i0.u114.Section_82>=1))" M !"((!(((i0.u34.F94>=1)&&(i0.u123.Section_93>=1))&&((i18.i0.i0.u114....262
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 163539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 558 transition count 287
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 194 place count 558 transition count 271
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 226 place count 542 transition count 271
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 528 transition count 257
Applied a total of 254 rules in 36 ms. Remains 528 /655 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 528 cols
[2024-05-21 10:42:47] [INFO ] Computed 272 invariants in 5 ms
[2024-05-21 10:42:47] [INFO ] Implicit Places using invariants in 307 ms returned [12, 63, 79, 238, 241, 250, 285, 296, 342, 399, 422, 465, 514, 520, 525]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 310 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/655 places, 257/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 256
Applied a total of 2 rules in 14 ms. Remains 512 /513 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 512 cols
[2024-05-21 10:42:47] [INFO ] Computed 257 invariants in 2 ms
[2024-05-21 10:42:47] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 10:42:47] [INFO ] Invariant cache hit.
[2024-05-21 10:42:48] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/655 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 993 ms. Remains : 512/655 places, 256/384 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09
Product exploration explored 100000 steps with 723 reset in 1599 ms.
Product exploration explored 100000 steps with 766 reset in 1751 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 552 steps (0 resets) in 18 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-05-21 10:42:52] [INFO ] Invariant cache hit.
[2024-05-21 10:42:52] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-21 10:42:52] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-21 10:42:53] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2024-05-21 10:42:53] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 10:43:07] [INFO ] Added : 126 causal constraints over 26 iterations in 13671 ms. Result :sat
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 15 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 10:43:07] [INFO ] Invariant cache hit.
[2024-05-21 10:43:07] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 10:43:07] [INFO ] Invariant cache hit.
[2024-05-21 10:43:07] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-21 10:43:07] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 10:43:07] [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 8062 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38090ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38816 ms. Remains : 512/512 places, 256/256 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 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 45 ms :[(NOT p0)]
RANDOM walk for 475 steps (0 resets) in 17 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 119 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 26 ms :[(NOT p0)]
[2024-05-21 10:43:46] [INFO ] Invariant cache hit.
[2024-05-21 10:43:46] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-21 10:43:46] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-21 10:43:47] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2024-05-21 10:43:47] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-21 10:44:01] [INFO ] Added : 126 causal constraints over 26 iterations in 13716 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 715 reset in 1603 ms.
Product exploration explored 100000 steps with 711 reset in 1735 ms.
Built C files in :
/tmp/ltsmin17996240803234776121
[2024-05-21 10:44:04] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 10:44:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:44:04] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 10:44:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:44:04] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-21 10:44:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:44:04] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17996240803234776121
Running compilation step : cd /tmp/ltsmin17996240803234776121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 648 ms.
Running link step : cd /tmp/ltsmin17996240803234776121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17996240803234776121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17748006133154763665.hoa' '--buchi-type=spotba'
LTSmin run took 1803 ms.
FORMULA CircularTrains-PT-384-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 80024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((X(p1)||F(p2)))))'
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-21 10:44:07] [INFO ] Computed 272 invariants in 9 ms
[2024-05-21 10:44:07] [INFO ] Implicit Places using invariants in 335 ms returned [14, 72, 90, 287, 290, 303, 348, 365, 420, 499, 526, 583, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 336 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 21615 reset in 1694 ms.
Product exploration explored 100000 steps with 22761 reset in 1844 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 837 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1689 steps (0 resets) in 52 ms. (31 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (AND (NOT p2) p0))), (F p1)]
Knowledge based reduction with 2 factoid took 1042 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
// Phase 1: matrix 384 rows 641 cols
[2024-05-21 10:44:14] [INFO ] Computed 258 invariants in 5 ms
[2024-05-21 10:44:14] [INFO ] [Real]Absence check using 255 positive place invariants in 81 ms returned sat
[2024-05-21 10:44:14] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 26 ms returned sat
[2024-05-21 10:44:17] [INFO ] [Real]Absence check using state equation in 2533 ms returned sat
[2024-05-21 10:44:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:44:17] [INFO ] [Nat]Absence check using 255 positive place invariants in 81 ms returned sat
[2024-05-21 10:44:17] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 26 ms returned sat
[2024-05-21 10:44:22] [INFO ] [Nat]Absence check using state equation in 4489 ms returned sat
[2024-05-21 10:44:22] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 10:44:32] [INFO ] Added : 85 causal constraints over 17 iterations in 10147 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:44:32] [INFO ] Invariant cache hit.
[2024-05-21 10:44:32] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-21 10:44:32] [INFO ] Invariant cache hit.
[2024-05-21 10:44:33] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23053 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53094ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53096ms
Finished structural reductions in LTL mode , in 1 iterations and 53896 ms. Remains : 641/641 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 847 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1793 steps (0 resets) in 43 ms. (40 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (AND (NOT p2) p0))), (F p1)]
Knowledge based reduction with 2 factoid took 1057 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 466 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
[2024-05-21 10:45:29] [INFO ] Invariant cache hit.
[2024-05-21 10:45:30] [INFO ] [Real]Absence check using 255 positive place invariants in 120 ms returned sat
[2024-05-21 10:45:30] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 34 ms returned sat
[2024-05-21 10:45:31] [INFO ] [Real]Absence check using state equation in 1700 ms returned sat
[2024-05-21 10:45:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:45:32] [INFO ] [Nat]Absence check using 255 positive place invariants in 88 ms returned sat
[2024-05-21 10:45:32] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 27 ms returned sat
[2024-05-21 10:45:36] [INFO ] [Nat]Absence check using state equation in 3990 ms returned sat
[2024-05-21 10:45:36] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-21 10:45:47] [INFO ] Added : 80 causal constraints over 16 iterations in 10668 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 21370 reset in 1716 ms.
Product exploration explored 100000 steps with 21763 reset in 1832 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 641 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 124 place count 641 transition count 384
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 641 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 641 transition count 384
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 127 rules in 76 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:45:51] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 641 cols
[2024-05-21 10:45:51] [INFO ] Computed 258 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-21 10:45:56] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 11 ms to minimize.
[2024-05-21 10:45:56] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-21 10:45:56] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-21 10:45:56] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 3 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:45:57] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 20/277 constraints. Problems are: Problem set: 20 solved, 236 unsolved
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 14 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 6 ms to minimize.
[2024-05-21 10:45:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 20/297 constraints. Problems are: Problem set: 40 solved, 216 unsolved
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-21 10:45:59] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 10:46:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 10:46:01] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-21 10:46:01] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 20/317 constraints. Problems are: Problem set: 60 solved, 196 unsolved
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 10:46:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:46:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:46:04] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:46:04] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-21 10:46:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD215 is UNSAT
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD234 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 20/337 constraints. Problems are: Problem set: 80 solved, 176 unsolved
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 10:46:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD166 is UNSAT
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:46:06] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 20/357 constraints. Problems are: Problem set: 100 solved, 156 unsolved
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 10:46:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 10:46:08] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 5/362 constraints. Problems are: Problem set: 105 solved, 151 unsolved
[2024-05-21 10:46:11] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-21 10:46:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 10:46:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 10:46:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 10:46:11] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 5/367 constraints. Problems are: Problem set: 110 solved, 146 unsolved
[2024-05-21 10:46:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-05-21 10:46:12] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 10:46:13] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 9/376 constraints. Problems are: Problem set: 118 solved, 138 unsolved
[2024-05-21 10:46:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 1/377 constraints. Problems are: Problem set: 119 solved, 137 unsolved
[2024-05-21 10:46:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-21 10:46:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-21 10:46:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 10:46:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 4/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 0/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 15 (OVERLAPS) 1/641 variables, 1/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/1025 variables, and 382 constraints, problems are : Problem set: 123 solved, 133 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 123 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 378/640 variables, 255/255 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 124/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/381 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/1023 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 129/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/1025 variables, 0/1152 constraints. Problems are: Problem set: 127 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1152 constraints, problems are : Problem set: 127 solved, 129 unsolved in 29057 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 129/256 constraints, Known Traps: 124/124 constraints]
After SMT, in 59092ms problems are : Problem set: 127 solved, 129 unsolved
Search for dead transitions found 127 dead transitions in 59096ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 641/641 places, 257/384 transitions.
Graph (complete) has 1028 edges and 641 vertex of which 514 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.2 ms
Discarding 127 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 514 /641 variables (removed 127) and now considering 257/257 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/641 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59198 ms. Remains : 514/641 places, 257/384 transitions.
Built C files in :
/tmp/ltsmin17042447094551032335
[2024-05-21 10:46:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17042447094551032335
Running compilation step : cd /tmp/ltsmin17042447094551032335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 813 ms.
Running link step : cd /tmp/ltsmin17042447094551032335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17042447094551032335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4573505909071743648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 27 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2024-05-21 10:47:05] [INFO ] Computed 258 invariants in 8 ms
[2024-05-21 10:47:06] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-21 10:47:06] [INFO ] Invariant cache hit.
[2024-05-21 10:47:06] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:47:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1025 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23449 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/640 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53504ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53507ms
Finished structural reductions in LTL mode , in 1 iterations and 54284 ms. Remains : 641/641 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin7832413386039330968
[2024-05-21 10:48:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7832413386039330968
Running compilation step : cd /tmp/ltsmin7832413386039330968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 861 ms.
Running link step : cd /tmp/ltsmin7832413386039330968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7832413386039330968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12294850707240992527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:48:15] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:48:15] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:48:15] [INFO ] Time to serialize gal into /tmp/LTL5135051514441296097.gal : 2 ms
[2024-05-21 10:48:15] [INFO ] Time to serialize properties into /tmp/LTL11068683275181290424.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5135051514441296097.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4818284230093972097.hoa' '-atoms' '/tmp/LTL11068683275181290424.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11068683275181290424.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4818284230093972097.hoa
Detected timeout of ITS tools.
[2024-05-21 10:48:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:48:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:48:30] [INFO ] Time to serialize gal into /tmp/LTL1129923119625404914.gal : 2 ms
[2024-05-21 10:48:30] [INFO ] Time to serialize properties into /tmp/LTL10950636916871113419.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1129923119625404914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10950636916871113419.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("((Section_222>=1)&&(F223>=1))"))U(G((X("(((F255>=1)&&(Section_254>=1))||((Section_337>=1)&&(F338>=1)))"))||(F("((Section_337>=1...175
Formula 0 simplified : X!"((Section_222>=1)&&(F223>=1))" R F(X!"(((F255>=1)&&(Section_254>=1))||((Section_337>=1)&&(F338>=1)))" & G!"((Section_337>=1)&&(F3...164
Detected timeout of ITS tools.
[2024-05-21 10:48:45] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:48:45] [INFO ] Applying decomposition
[2024-05-21 10:48:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17050247935188992806.txt' '-o' '/tmp/graph17050247935188992806.bin' '-w' '/tmp/graph17050247935188992806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17050247935188992806.bin' '-l' '-1' '-v' '-w' '/tmp/graph17050247935188992806.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:48:45] [INFO ] Decomposing Gal with order
[2024-05-21 10:48:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:48:45] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:48:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:48:45] [INFO ] Time to serialize gal into /tmp/LTL4931349786880085250.gal : 4 ms
[2024-05-21 10:48:45] [INFO ] Time to serialize properties into /tmp/LTL1018201993236388904.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4931349786880085250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1018201993236388904.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X("((i20.i1.u84.Section_222>=1)&&(i20.i1.u84.F223>=1))"))U(G((X("(((i18.i0.u43.F255>=1)&&(i18.i0.u119.Section_254>=1))||((i2.i1.u1...260
Formula 0 simplified : X!"((i20.i1.u84.Section_222>=1)&&(i20.i1.u84.F223>=1))" R F(X!"(((i18.i0.u43.F255>=1)&&(i18.i0.u119.Section_254>=1))||((i2.i1.u13.Se...249
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 293102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 655 cols
[2024-05-21 10:49:00] [INFO ] Computed 272 invariants in 10 ms
[2024-05-21 10:49:00] [INFO ] Implicit Places using invariants in 343 ms returned [14, 72, 90, 290, 303, 348, 365, 420, 499, 526, 583, 637, 646, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 344 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/655 places, 384/384 transitions.
Applied a total of 0 rules in 11 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 373 ms. Remains : 641/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-384-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((!p1||X(!p2))))||G(!p3))))'
Support contains 8 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 655 /655 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:49:01] [INFO ] Invariant cache hit.
[2024-05-21 10:49:01] [INFO ] Implicit Places using invariants in 308 ms returned [14, 72, 90, 287, 303, 348, 365, 420, 526, 583, 637, 646, 651]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 308 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/655 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 333 ms. Remains : 642/655 places, 384/384 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND p1 p2 p3), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2 p3), (AND p1 p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14
Product exploration explored 100000 steps with 294 reset in 1451 ms.
Product exploration explored 100000 steps with 274 reset in 1560 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 30 factoid took 798 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 2559 steps (0 resets) in 48 ms. (52 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 30 factoid took 1047 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Support contains 6 out of 642 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2024-05-21 10:49:06] [INFO ] Computed 259 invariants in 8 ms
[2024-05-21 10:49:07] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-21 10:49:07] [INFO ] Invariant cache hit.
[2024-05-21 10:49:07] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:49:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/1026 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 901 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23226 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1026 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 53272ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 53275ms
Finished structural reductions in LTL mode , in 1 iterations and 54101 ms. Remains : 642/642 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 2987 steps (0 resets) in 66 ms. (44 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3)]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 287 reset in 1440 ms.
Product exploration explored 100000 steps with 300 reset in 1559 ms.
Built C files in :
/tmp/ltsmin14724703991682129368
[2024-05-21 10:50:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14724703991682129368
Running compilation step : cd /tmp/ltsmin14724703991682129368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 743 ms.
Running link step : cd /tmp/ltsmin14724703991682129368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14724703991682129368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7180962876702507925.hoa' '--buchi-type=spotba'
LTSmin run took 6705 ms.
FORMULA CircularTrains-PT-384-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 71743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLFireability-02
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 655 transition count 286
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 197 place count 557 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 556 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 198 place count 556 transition count 273
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 222 place count 544 transition count 273
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 250 place count 530 transition count 259
Applied a total of 250 rules in 32 ms. Remains 530 /655 variables (removed 125) and now considering 259/384 (removed 125) transitions.
// Phase 1: matrix 259 rows 530 cols
[2024-05-21 10:50:12] [INFO ] Computed 272 invariants in 5 ms
[2024-05-21 10:50:13] [INFO ] Implicit Places using invariants in 279 ms returned [12, 63, 79, 239, 242, 251, 286, 297, 344, 401, 424, 516, 527]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 279 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 517/655 places, 259/384 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 516 transition count 258
Applied a total of 2 rules in 15 ms. Remains 516 /517 variables (removed 1) and now considering 258/259 (removed 1) transitions.
// Phase 1: matrix 258 rows 516 cols
[2024-05-21 10:50:13] [INFO ] Computed 259 invariants in 3 ms
[2024-05-21 10:50:13] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 10:50:13] [INFO ] Invariant cache hit.
[2024-05-21 10:50:13] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 516/655 places, 258/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 983 ms. Remains : 516/655 places, 258/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 901 reset in 1752 ms.
Product exploration explored 100000 steps with 904 reset in 1903 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 994 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 4492 steps (0 resets) in 160 ms. (27 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1265 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-21 10:50:20] [INFO ] Invariant cache hit.
[2024-05-21 10:50:20] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-21 10:50:20] [INFO ] Invariant cache hit.
[2024-05-21 10:50:20] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 10:50:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9308 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39335ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39337ms
Finished structural reductions in LTL mode , in 1 iterations and 39987 ms. Remains : 516/516 places, 258/258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1074 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 3647 steps (0 resets) in 95 ms. (37 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 1322 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 880 reset in 1758 ms.
Product exploration explored 100000 steps with 872 reset in 1881 ms.
Built C files in :
/tmp/ltsmin12596922641314088934
[2024-05-21 10:51:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12596922641314088934
Running compilation step : cd /tmp/ltsmin12596922641314088934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 546 ms.
Running link step : cd /tmp/ltsmin12596922641314088934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12596922641314088934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15637152714298020485.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-21 10:51:22] [INFO ] Invariant cache hit.
[2024-05-21 10:51:22] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-21 10:51:22] [INFO ] Invariant cache hit.
[2024-05-21 10:51:22] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 10:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/774 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 775 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9098 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 255/515 variables, 255/257 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 258/774 variables, 516/775 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 130/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 905 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 39120ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 39121ms
Finished structural reductions in LTL mode , in 1 iterations and 39817 ms. Remains : 516/516 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin15087281666620870425
[2024-05-21 10:52:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15087281666620870425
Running compilation step : cd /tmp/ltsmin15087281666620870425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 550 ms.
Running link step : cd /tmp/ltsmin15087281666620870425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15087281666620870425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11222573730978067055.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:52:17] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:52:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:52:17] [INFO ] Time to serialize gal into /tmp/LTL10622182592457468917.gal : 2 ms
[2024-05-21 10:52:17] [INFO ] Time to serialize properties into /tmp/LTL4132119438904412964.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10622182592457468917.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7779441915239062397.hoa' '-atoms' '/tmp/LTL4132119438904412964.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4132119438904412964.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7779441915239062397.hoa
Detected timeout of ITS tools.
[2024-05-21 10:52:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:52:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:52:32] [INFO ] Time to serialize gal into /tmp/LTL3244939256762711676.gal : 2 ms
[2024-05-21 10:52:32] [INFO ] Time to serialize properties into /tmp/LTL3375766482718562085.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3244939256762711676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3375766482718562085.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((Section_34<1)||(F35<1))"))||(X((X(!("((Section_115>=1)&&(F116>=1))")))U((X(G(!("((Section_115>=1)&&(F116>=1))"))))||((!("((...233
Formula 0 simplified : G(F!"((Section_34<1)||(F35<1))" & X(X"((Section_115>=1)&&(F116>=1))" R (XF"((Section_115>=1)&&(F116>=1))" & ("((F112>=1)&&(Section_1...202
Detected timeout of ITS tools.
[2024-05-21 10:52:47] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:52:47] [INFO ] Applying decomposition
[2024-05-21 10:52:47] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17872780288323501405.txt' '-o' '/tmp/graph17872780288323501405.bin' '-w' '/tmp/graph17872780288323501405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17872780288323501405.bin' '-l' '-1' '-v' '-w' '/tmp/graph17872780288323501405.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:52:47] [INFO ] Decomposing Gal with order
[2024-05-21 10:52:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:52:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:52:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:52:47] [INFO ] Time to serialize gal into /tmp/LTL16837450556230403906.gal : 4 ms
[2024-05-21 10:52:47] [INFO ] Time to serialize properties into /tmp/LTL13904590056994503301.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16837450556230403906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13904590056994503301.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i18.i1.i0.u116.Section_34<1)||(i18.i1.i0.u116.F35<1))"))||(X((X(!("((i19.i1.i1.u165.Section_115>=1)&&(i19.i1.i1.u165.F116>=...383
Formula 0 simplified : G(F!"((i18.i1.i0.u116.Section_34<1)||(i18.i1.i0.u116.F35<1))" & X(X"((i19.i1.i1.u165.Section_115>=1)&&(i19.i1.i1.u165.F116>=1))" R (...352
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 169757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((X(p1)||F(p2)))))'
Found a Lengthening insensitive property : CircularTrains-PT-384-LTLFireability-10
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 655 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 655/655 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 655 transition count 287
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 558 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 557 transition count 286
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 196 place count 557 transition count 272
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 224 place count 543 transition count 272
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 252 place count 529 transition count 258
Applied a total of 252 rules in 26 ms. Remains 529 /655 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 529 cols
[2024-05-21 10:53:03] [INFO ] Computed 272 invariants in 4 ms
[2024-05-21 10:53:03] [INFO ] Implicit Places using invariants in 312 ms returned [12, 64, 80, 239, 242, 251, 286, 297, 343, 400, 423, 466, 521, 526]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 313 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 515/655 places, 258/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 10 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2024-05-21 10:53:03] [INFO ] Computed 258 invariants in 3 ms
[2024-05-21 10:53:03] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 10:53:03] [INFO ] Invariant cache hit.
[2024-05-21 10:53:04] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 514/655 places, 257/384 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1000 ms. Remains : 514/655 places, 257/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 22737 reset in 1721 ms.
Product exploration explored 100000 steps with 23065 reset in 1856 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 740 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 1157 steps (0 resets) in 49 ms. (23 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 1 factoid took 1030 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
[2024-05-21 10:53:10] [INFO ] Invariant cache hit.
[2024-05-21 10:53:10] [INFO ] [Real]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-21 10:53:10] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 20 ms returned sat
[2024-05-21 10:53:11] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2024-05-21 10:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:53:11] [INFO ] [Nat]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-21 10:53:11] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 13 ms returned sat
[2024-05-21 10:53:13] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2024-05-21 10:53:13] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-21 10:53:25] [INFO ] Added : 126 causal constraints over 26 iterations in 12553 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:53:25] [INFO ] Invariant cache hit.
[2024-05-21 10:53:26] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-21 10:53:26] [INFO ] Invariant cache hit.
[2024-05-21 10:53:26] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-21 10:53:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9115 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39142ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39143ms
Finished structural reductions in LTL mode , in 1 iterations and 39819 ms. Remains : 514/514 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 767 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 983 steps (0 resets) in 47 ms. (20 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 1 factoid took 1047 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
[2024-05-21 10:54:08] [INFO ] Invariant cache hit.
[2024-05-21 10:54:08] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-21 10:54:08] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 21 ms returned sat
[2024-05-21 10:54:09] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2024-05-21 10:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:54:09] [INFO ] [Nat]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-21 10:54:09] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-21 10:54:11] [INFO ] [Nat]Absence check using state equation in 1721 ms returned sat
[2024-05-21 10:54:11] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-21 10:54:24] [INFO ] Added : 126 causal constraints over 26 iterations in 12556 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 23345 reset in 1758 ms.
Product exploration explored 100000 steps with 23203 reset in 1891 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p2), false, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:54:28] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9161 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39190ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39192ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39213 ms. Remains : 514/514 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin13714352303795437740
[2024-05-21 10:55:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13714352303795437740
Running compilation step : cd /tmp/ltsmin13714352303795437740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 675 ms.
Running link step : cd /tmp/ltsmin13714352303795437740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13714352303795437740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1415907102602200884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:55:23] [INFO ] Invariant cache hit.
[2024-05-21 10:55:23] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-21 10:55:23] [INFO ] Invariant cache hit.
[2024-05-21 10:55:23] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-21 10:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9173 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 39203ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 39204ms
Finished structural reductions in LTL mode , in 1 iterations and 39912 ms. Remains : 514/514 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin17831698017120537467
[2024-05-21 10:56:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17831698017120537467
Running compilation step : cd /tmp/ltsmin17831698017120537467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 574 ms.
Running link step : cd /tmp/ltsmin17831698017120537467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17831698017120537467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16528423603019782639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:56:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:56:18] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:56:18] [INFO ] Time to serialize gal into /tmp/LTL6328546843295384426.gal : 2 ms
[2024-05-21 10:56:18] [INFO ] Time to serialize properties into /tmp/LTL15974535833288062375.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6328546843295384426.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4817767955821197543.hoa' '-atoms' '/tmp/LTL15974535833288062375.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15974535833288062375.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4817767955821197543.hoa
Detected timeout of ITS tools.
[2024-05-21 10:56:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:56:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 10:56:33] [INFO ] Time to serialize gal into /tmp/LTL8932086210735756578.gal : 2 ms
[2024-05-21 10:56:33] [INFO ] Time to serialize properties into /tmp/LTL3212526456638358410.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8932086210735756578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3212526456638358410.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X("((Section_222>=1)&&(F223>=1))"))U(G((X("(((F255>=1)&&(Section_254>=1))||((Section_337>=1)&&(F338>=1)))"))||(F("((Section_337>=1...175
Formula 0 simplified : X!"((Section_222>=1)&&(F223>=1))" R F(X!"(((F255>=1)&&(Section_254>=1))||((Section_337>=1)&&(F338>=1)))" & G!"((Section_337>=1)&&(F3...164
Detected timeout of ITS tools.
[2024-05-21 10:56:48] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:56:48] [INFO ] Applying decomposition
[2024-05-21 10:56:48] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10456265158136911044.txt' '-o' '/tmp/graph10456265158136911044.bin' '-w' '/tmp/graph10456265158136911044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10456265158136911044.bin' '-l' '-1' '-v' '-w' '/tmp/graph10456265158136911044.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:56:48] [INFO ] Decomposing Gal with order
[2024-05-21 10:56:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:56:48] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:56:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 10:56:48] [INFO ] Time to serialize gal into /tmp/LTL14195796969537681371.gal : 5 ms
[2024-05-21 10:56:48] [INFO ] Time to serialize properties into /tmp/LTL15938974861481962442.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14195796969537681371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15938974861481962442.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X("((i12.i1.i1.u178.Section_222>=1)&&(i12.i1.i0.u195.F223>=1))"))U(G((X("(((i3.i1.i0.u2.F255>=1)&&(i3.i1.i0.u3.Section_254>=1))||(...285
Formula 0 simplified : X!"((i12.i1.i1.u178.Section_222>=1)&&(i12.i1.i0.u195.F223>=1))" R F(X!"(((i3.i1.i0.u2.F255>=1)&&(i3.i1.i0.u3.Section_254>=1))||((i21...274
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 240768 ms.
[2024-05-21 10:57:03] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11072331512670639321
[2024-05-21 10:57:03] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2024-05-21 10:57:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:57:03] [INFO ] Applying decomposition
[2024-05-21 10:57:03] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2024-05-21 10:57:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:57:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 10:57:03] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2024-05-21 10:57:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:57:03] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11072331512670639321
Running compilation step : cd /tmp/ltsmin11072331512670639321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8675957390544170801.txt' '-o' '/tmp/graph8675957390544170801.bin' '-w' '/tmp/graph8675957390544170801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8675957390544170801.bin' '-l' '-1' '-v' '-w' '/tmp/graph8675957390544170801.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:57:03] [INFO ] Decomposing Gal with order
[2024-05-21 10:57:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:57:03] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:57:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:57:03] [INFO ] Time to serialize gal into /tmp/LTLFireability2515339197790854369.gal : 3 ms
[2024-05-21 10:57:03] [INFO ] Time to serialize properties into /tmp/LTLFireability7730760516302020712.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2515339197790854369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7730760516302020712.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F((G("((i7.i1.u66.Section_34<1)||(i7.i1.u39.F35<1))"))||(X((X(!("((i16.i1.u32.Section_115>=1)&&(i16.i1.u32.F116>=1))")))U(((!("((i1...341
Formula 0 simplified : G(F!"((i7.i1.u66.Section_34<1)||(i7.i1.u39.F35<1))" & X(X"((i16.i1.u32.Section_115>=1)&&(i16.i1.u32.F116>=1))" R (XF"((i16.i1.u32.Se...310
Compilation finished in 976 ms.
Running link step : cd /tmp/ltsmin11072331512670639321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11072331512670639321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11072331512670639321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X((X(!(LTLAPp1==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp1==true)))||X([](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11072331512670639321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: Initializing POR dependencies: labels 392, guards 384
pins2lts-mc-linux64( 6/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 2.778: LTL layer: formula: [](<>((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))))
pins2lts-mc-linux64( 4/ 8), 2.778: "[](<>((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 2.779: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 3.076: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 3.090: There are 393 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.090: State length is 656, there are 390 groups
pins2lts-mc-linux64( 0/ 8), 3.090: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.090: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.090: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 3.090: Visible groups: 0 / 390, labels: 2 / 393
pins2lts-mc-linux64( 0/ 8), 3.090: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 3.090: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 3.124: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 5/ 8), 3.153: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 0/ 8), 3.205: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 4/ 8), 3.272: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 7/ 8), 3.407: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 0/ 8), 3.656: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 3/ 8), 4.114: [Blue] ~7680 levels ~122880 states ~61440 transitions
pins2lts-mc-linux64( 4/ 8), 4.114: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 7/ 8), 7.250: [Blue] ~23914 levels ~245760 states ~285216 transitions
pins2lts-mc-linux64( 3/ 8), 11.208: [Blue] ~42335 levels ~491520 states ~653352 transitions
pins2lts-mc-linux64( 4/ 8), 18.359: [Blue] ~97366 levels ~983040 states ~1205976 transitions
pins2lts-mc-linux64( 1/ 8), 31.609: [Blue] ~212221 levels ~1966080 states ~2207080 transitions
pins2lts-mc-linux64( 1/ 8), 57.836: [Blue] ~413263 levels ~3932160 states ~4463984 transitions
pins2lts-mc-linux64( 1/ 8), 110.486: [Blue] ~803454 levels ~7864320 states ~9022128 transitions
pins2lts-mc-linux64( 1/ 8), 216.946: [Blue] ~1569322 levels ~15728640 states ~18156832 transitions
pins2lts-mc-linux64( 1/ 8), 282.370: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 282.506:
pins2lts-mc-linux64( 0/ 8), 282.506: Explored 20018198 states 25256260 transitions, fanout: 1.262
pins2lts-mc-linux64( 0/ 8), 282.506: Total exploration time 279.400 sec (279.260 sec minimum, 279.296 sec on average)
pins2lts-mc-linux64( 0/ 8), 282.506: States per second: 71647, Transitions per second: 90395
pins2lts-mc-linux64( 0/ 8), 282.506:
pins2lts-mc-linux64( 0/ 8), 282.506: State space has 20169271 states, 4718486 are accepting
pins2lts-mc-linux64( 0/ 8), 282.506: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 282.506: blue states: 20018198 (99.25%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 282.506: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 282.506: all-red states: 4718486 (23.39%), bogus 3325 (0.02%)
pins2lts-mc-linux64( 0/ 8), 282.506:
pins2lts-mc-linux64( 0/ 8), 282.506: Total memory used for local state coloring: 206.2MB
pins2lts-mc-linux64( 0/ 8), 282.506:
pins2lts-mc-linux64( 0/ 8), 282.506: Queue width: 8B, total height: 13515221, memory: 103.11MB
pins2lts-mc-linux64( 0/ 8), 282.506: Tree memory: 409.9MB, 21.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 282.506: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 282.506: Stored 386 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 282.506: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 282.506: Est. total memory use: 513.0MB (~1127.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11072331512670639321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11072331512670639321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-21 11:12:48] [INFO ] Flatten gal took : 10 ms
[2024-05-21 11:12:48] [INFO ] Time to serialize gal into /tmp/LTLFireability5223498223028886038.gal : 6 ms
[2024-05-21 11:12:48] [INFO ] Time to serialize properties into /tmp/LTLFireability10553066135980832546.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5223498223028886038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10553066135980832546.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F((G("((Section_34<1)||(F35<1))"))||(X((X(!("((Section_115>=1)&&(F116>=1))")))U(((!("((F112>=1)&&(Section_111>=1))"))&&(X(!("((Sect...233
Formula 0 simplified : G(F!"((Section_34<1)||(F35<1))" & X(X"((Section_115>=1)&&(F116>=1))" R (XF"((Section_115>=1)&&(F116>=1))" & ("((F112>=1)&&(Section_1...202
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-384"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CircularTrains-PT-384, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505700364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-384.tgz
mv CircularTrains-PT-384 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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