Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 10K Apr 30 07:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 07:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 07:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 293K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652685834781

Running Version 202205111006
[2022-05-16 07:23:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:23:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:23:56] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-05-16 07:23:56] [INFO ] Transformed 768 places.
[2022-05-16 07:23:56] [INFO ] Transformed 384 transitions.
[2022-05-16 07:23:56] [INFO ] Parsed PT model containing 768 places and 384 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CircularTrains-PT-384-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 84 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2022-05-16 07:23:56] [INFO ] Computed 385 place invariants in 69 ms
[2022-05-16 07:23:57] [INFO ] Implicit Places using invariants in 717 ms returned [1, 7, 9, 17, 21, 26, 32, 42, 48, 58, 63, 64, 71, 85, 86, 88, 98, 103, 107, 108, 109, 133, 135, 137, 158, 162, 174, 179, 185, 193, 198, 203, 215, 220, 221, 230, 245, 246, 254, 270, 276, 287, 293, 303, 331, 334, 340, 346, 347, 350, 351, 353, 354, 357, 390, 397, 403, 411, 412, 422, 426, 433, 447, 448, 449, 470, 475, 476, 485, 496, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 576, 579, 580, 586, 600, 607, 619, 622, 625, 628, 638, 643, 644, 647, 648, 666, 671, 674, 677, 689, 693, 700, 708, 715, 718, 719, 723, 735, 740, 741, 743, 746, 747, 749, 755, 758, 759, 763, 764]
Discarding 119 places :
Implicit Place search using SMT only with invariants took 744 ms to find 119 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/768 places, 384/384 transitions.
Applied a total of 0 rules in 139 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 649/768 places, 384/384 transitions.
Support contains 49 out of 649 places after structural reductions.
[2022-05-16 07:23:57] [INFO ] Flatten gal took : 61 ms
[2022-05-16 07:23:57] [INFO ] Flatten gal took : 29 ms
[2022-05-16 07:23:57] [INFO ] Input system was already deterministic with 384 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 31) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:23:58] [INFO ] Computed 266 place invariants in 29 ms
[2022-05-16 07:23:59] [INFO ] [Real]Absence check using 254 positive place invariants in 31 ms returned sat
[2022-05-16 07:23:59] [INFO ] [Real]Absence check using 254 positive and 12 generalized place invariants in 10 ms returned sat
[2022-05-16 07:23:59] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-384-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-384-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(p0))||G(!p0)))))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:23:59] [INFO ] Computed 266 place invariants in 10 ms
[2022-05-16 07:23:59] [INFO ] Implicit Places using invariants in 323 ms returned [38, 141, 258, 311, 329, 432, 567, 643]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 325 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/649 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 641/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, p0, (NOT p0), false, false, false, false, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=5, aps=[p0:(GT s618 s473)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 5 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-00 finished in 754 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X((G(p0) U p1))&&F(X(p2)))) U X(p2)))'
Support contains 5 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:24:00] [INFO ] Computed 266 place invariants in 4 ms
[2022-05-16 07:24:00] [INFO ] Implicit Places using invariants in 299 ms returned [38, 141, 258, 311, 329, 432, 567, 625, 643]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 301 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/649 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 640/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s549), p1:(LEQ s416 s528), p0:(LEQ s309 s502)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1162 steps with 270 reset in 43 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-01 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(X(p1))&&G(p1)&&p2))))'
Support contains 5 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:24:00] [INFO ] Computed 266 place invariants in 5 ms
[2022-05-16 07:24:00] [INFO ] Implicit Places using invariants in 294 ms returned [38, 258, 311, 329, 432, 567, 625, 643]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 295 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/649 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 641/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(LEQ s140 s274), p0:(LEQ s403 s188), p2:(OR (LEQ s140 s274) (LEQ 3 s519))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 6 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-02 finished in 534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:24:01] [INFO ] Computed 266 place invariants in 8 ms
[2022-05-16 07:24:01] [INFO ] Implicit Places using invariants in 302 ms returned [38, 141, 258, 329, 432, 567, 625, 643]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 304 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/649 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 641/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s308 s504)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 392 reset in 1545 ms.
Product exploration explored 100000 steps with 391 reset in 1602 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 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 264 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=24 )
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 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 384 rows 641 cols
[2022-05-16 07:24:05] [INFO ] Computed 258 place invariants in 8 ms
[2022-05-16 07:24:05] [INFO ] [Real]Absence check using 255 positive place invariants in 92 ms returned sat
[2022-05-16 07:24:05] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 50 ms returned sat
[2022-05-16 07:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:24:06] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2022-05-16 07:24:06] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 07:24:09] [INFO ] Added : 253 causal constraints over 51 iterations in 3005 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 641 transition count 259
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 250 place count 516 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 250 place count 516 transition count 257
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 254 place count 514 transition count 257
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 2 with 2 rules applied. Total rules applied 256 place count 513 transition count 256
Applied a total of 256 rules in 51 ms. Remains 513 /641 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:24:09] [INFO ] Computed 258 place invariants in 6 ms
[2022-05-16 07:24:09] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:24:09] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:24:10] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2022-05-16 07:24:10] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:24:10] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:24:10] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/641 places, 256/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/641 places, 256/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
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 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:24:10] [INFO ] Computed 258 place invariants in 2 ms
[2022-05-16 07:24:10] [INFO ] [Real]Absence check using 255 positive place invariants in 80 ms returned sat
[2022-05-16 07:24:10] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 19 ms returned sat
[2022-05-16 07:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:24:11] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2022-05-16 07:24:11] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 07:24:12] [INFO ] Added : 126 causal constraints over 26 iterations in 1122 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1094 reset in 1641 ms.
Product exploration explored 100000 steps with 1119 reset in 1786 ms.
Built C files in :
/tmp/ltsmin675069837631154282
[2022-05-16 07:24:16] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-05-16 07:24:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:16] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-05-16 07:24:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:16] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2022-05-16 07:24:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:16] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin675069837631154282
Running compilation step : cd /tmp/ltsmin675069837631154282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 607 ms.
Running link step : cd /tmp/ltsmin675069837631154282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin675069837631154282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10085108180058450245.hoa' '--buchi-type=spotba'
LTSmin run took 839 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLCardinality-03 finished in 16713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((false U p0)||F((false U false))))))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:24:17] [INFO ] Computed 266 place invariants in 7 ms
[2022-05-16 07:24:18] [INFO ] Implicit Places using invariants in 301 ms returned [141, 258, 311, 329, 567, 625, 643]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 304 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/649 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.
Finished structural reductions, in 2 iterations. Remains : 642/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s38 s428)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 140 steps with 46 reset in 7 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-04 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F((F(G(!p0))||p1)))))'
Support contains 4 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:24:18] [INFO ] Computed 266 place invariants in 10 ms
[2022-05-16 07:24:18] [INFO ] Implicit Places using invariants in 306 ms returned [38, 141, 258, 311, 432, 567, 625, 643]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 307 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/649 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 2 iterations. Remains : 641/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), true]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ 2 s325) (LEQ s468 s35)), p0:(GT 1 s288)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-05 finished in 496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G((X(p0) U p0))) U (p0 U (false U p1))))))'
Support contains 4 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 649 /649 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 649 cols
[2022-05-16 07:24:18] [INFO ] Computed 266 place invariants in 7 ms
[2022-05-16 07:24:19] [INFO ] Implicit Places using invariants in 302 ms returned [38, 141, 258, 311, 329, 432, 567, 625, 643]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 304 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/649 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 2 iterations. Remains : 640/649 places, 384/384 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 4}, { cond=(NOT p0), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(NOT p0), acceptance={1} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={1} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}]], initial=0, aps=[p1:(GT s303 s383), p0:(LEQ s552 s261)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 336 reset in 1507 ms.
Product exploration explored 100000 steps with 350 reset in 1619 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) p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 490 ms. Reduced automaton from 6 states, 24 edges and 2 AP to 6 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 140 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 644 ms. Reduced automaton from 6 states, 24 edges and 2 AP to 6 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:24:24] [INFO ] Computed 257 place invariants in 5 ms
[2022-05-16 07:24:24] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:24:24] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:24:25] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 640 cols
[2022-05-16 07:24:25] [INFO ] Computed 257 place invariants in 7 ms
[2022-05-16 07:24:25] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 475 ms. Reduced automaton from 6 states, 24 edges and 2 AP to 6 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 788 steps, including 0 resets, run visited all 6 properties in 25 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 597 ms. Reduced automaton from 6 states, 24 edges and 2 AP to 6 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 311 reset in 1483 ms.
Product exploration explored 100000 steps with 336 reset in 1606 ms.
Built C files in :
/tmp/ltsmin14380482484717121053
[2022-05-16 07:24:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14380482484717121053
Running compilation step : cd /tmp/ltsmin14380482484717121053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin14380482484717121053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14380482484717121053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7001377120455445951.hoa' '--buchi-type=spotba'
LTSmin run took 2919 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLCardinality-07 finished in 15538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 649 transition count 276
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 541 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 216 place count 541 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 234 place count 532 transition count 267
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 252 place count 523 transition count 258
Applied a total of 252 rules in 46 ms. Remains 523 /649 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 523 cols
[2022-05-16 07:24:34] [INFO ] Computed 266 place invariants in 6 ms
[2022-05-16 07:24:34] [INFO ] Implicit Places using invariants in 285 ms returned [34, 118, 211, 256, 271, 353, 453, 504, 518]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 291 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/649 places, 258/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 514 /514 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 514/649 places, 258/384 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s255 s338)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 489 reset in 1536 ms.
Product exploration explored 100000 steps with 523 reset in 1659 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 258/258 transitions.
Applied a total of 0 rules in 19 ms. Remains 514 /514 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 514 cols
[2022-05-16 07:24:38] [INFO ] Computed 257 place invariants in 7 ms
[2022-05-16 07:24:38] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 258 rows 514 cols
[2022-05-16 07:24:38] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:24:39] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2022-05-16 07:24:39] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 258 rows 514 cols
[2022-05-16 07:24:39] [INFO ] Computed 257 place invariants in 9 ms
[2022-05-16 07:24:39] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 476 reset in 1523 ms.
Product exploration explored 100000 steps with 490 reset in 1636 ms.
Built C files in :
/tmp/ltsmin6012007769680781890
[2022-05-16 07:24:43] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-05-16 07:24:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:43] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-05-16 07:24:43] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:43] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-05-16 07:24:43] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:43] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6012007769680781890
Running compilation step : cd /tmp/ltsmin6012007769680781890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin6012007769680781890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6012007769680781890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased708825518489906507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 258/258 transitions.
Applied a total of 0 rules in 17 ms. Remains 514 /514 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 514 cols
[2022-05-16 07:24:58] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:24:58] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 258 rows 514 cols
[2022-05-16 07:24:58] [INFO ] Computed 257 place invariants in 3 ms
[2022-05-16 07:24:58] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2022-05-16 07:24:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 258 rows 514 cols
[2022-05-16 07:24:59] [INFO ] Computed 257 place invariants in 4 ms
[2022-05-16 07:24:59] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin12867294108290513475
[2022-05-16 07:24:59] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2022-05-16 07:24:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:59] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2022-05-16 07:24:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:59] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2022-05-16 07:24:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:24:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12867294108290513475
Running compilation step : cd /tmp/ltsmin12867294108290513475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 527 ms.
Running link step : cd /tmp/ltsmin12867294108290513475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12867294108290513475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13922660616287120189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:25:14] [INFO ] Flatten gal took : 19 ms
[2022-05-16 07:25:14] [INFO ] Flatten gal took : 19 ms
[2022-05-16 07:25:14] [INFO ] Time to serialize gal into /tmp/LTL91180521009727851.gal : 4 ms
[2022-05-16 07:25:14] [INFO ] Time to serialize properties into /tmp/LTL7533863577587951027.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL91180521009727851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7533863577587951027.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9118052...264
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(Section_169<=Section_157)")))))
Formula 0 simplified : !XGF"(Section_169<=Section_157)"
Detected timeout of ITS tools.
[2022-05-16 07:25:29] [INFO ] Flatten gal took : 22 ms
[2022-05-16 07:25:29] [INFO ] Applying decomposition
[2022-05-16 07:25:29] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1377567687613715229.txt' '-o' '/tmp/graph1377567687613715229.bin' '-w' '/tmp/graph1377567687613715229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1377567687613715229.bin' '-l' '-1' '-v' '-w' '/tmp/graph1377567687613715229.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:25:29] [INFO ] Decomposing Gal with order
[2022-05-16 07:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:25:29] [INFO ] Flatten gal took : 57 ms
[2022-05-16 07:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 07:25:29] [INFO ] Time to serialize gal into /tmp/LTL4095797930631160791.gal : 50 ms
[2022-05-16 07:25:29] [INFO ] Time to serialize properties into /tmp/LTL12629594043041355752.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4095797930631160791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12629594043041355752.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4095797...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(gu125.Section_169<=gu125.Section_157)")))))
Formula 0 simplified : !XGF"(gu125.Section_169<=gu125.Section_157)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8095368392589250724
[2022-05-16 07:25:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8095368392589250724
Running compilation step : cd /tmp/ltsmin8095368392589250724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 435 ms.
Running link step : cd /tmp/ltsmin8095368392589250724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8095368392589250724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-384-LTLCardinality-08 finished in 85560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(G((F(p0)&&F(p1))))))))'
Support contains 4 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 649 transition count 277
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 542 transition count 277
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 214 place count 542 transition count 266
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 236 place count 531 transition count 266
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 254 place count 522 transition count 257
Applied a total of 254 rules in 44 ms. Remains 522 /649 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 522 cols
[2022-05-16 07:26:00] [INFO ] Computed 266 place invariants in 2 ms
[2022-05-16 07:26:00] [INFO ] Implicit Places using invariants in 284 ms returned [34, 118, 256, 270, 352, 452, 503, 517]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 284 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/649 places, 257/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 514/649 places, 257/384 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s349 s209), p1:(GT s61 s325)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 273 reset in 1413 ms.
Product exploration explored 100000 steps with 328 reset in 1541 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 p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 467 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:26:04] [INFO ] Computed 258 place invariants in 5 ms
[2022-05-16 07:26:04] [INFO ] [Real]Absence check using 255 positive place invariants in 76 ms returned sat
[2022-05-16 07:26:04] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 19 ms returned unsat
Proved EG (NOT p0)
// Phase 1: matrix 257 rows 514 cols
[2022-05-16 07:26:04] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:26:04] [INFO ] [Real]Absence check using 255 positive place invariants in 80 ms returned sat
[2022-05-16 07:26:04] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 28 ms returned sat
[2022-05-16 07:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:26:05] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2022-05-16 07:26:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:26:05] [INFO ] [Nat]Absence check using 255 positive place invariants in 79 ms returned sat
[2022-05-16 07:26:05] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 24 ms returned sat
[2022-05-16 07:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:26:06] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-05-16 07:26:06] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-16 07:26:06] [INFO ] Added : 127 causal constraints over 26 iterations in 761 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA CircularTrains-PT-384-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 7212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((p0 U false)||p0)))))'
Support contains 2 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 384/384 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 649 transition count 275
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 218 place count 540 transition count 275
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 218 place count 540 transition count 265
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 238 place count 530 transition count 265
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 521 transition count 256
Applied a total of 256 rules in 33 ms. Remains 521 /649 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 521 cols
[2022-05-16 07:26:07] [INFO ] Computed 266 place invariants in 6 ms
[2022-05-16 07:26:07] [INFO ] Implicit Places using invariants in 287 ms returned [34, 118, 211, 256, 270, 351, 502, 516]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 290 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/649 places, 256/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/649 places, 256/384 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s491 s445)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1229 ms.
Product exploration explored 100000 steps with 0 reset in 1403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 361 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=36 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 256/256 transitions.
Applied a total of 0 rules in 17 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:26:10] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:26:10] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:26:10] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:26:11] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2022-05-16 07:26:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 513 cols
[2022-05-16 07:26:11] [INFO ] Computed 258 place invariants in 3 ms
[2022-05-16 07:26:11] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 256/256 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 307 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1249 ms.
Product exploration explored 100000 steps with 0 reset in 1408 ms.
Built C files in :
/tmp/ltsmin4782425063712168804
[2022-05-16 07:26:14] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-05-16 07:26:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:26:14] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-05-16 07:26:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:26:14] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2022-05-16 07:26:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:26:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4782425063712168804
Running compilation step : cd /tmp/ltsmin4782425063712168804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 534 ms.
Running link step : cd /tmp/ltsmin4782425063712168804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4782425063712168804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4174906268290043978.hoa' '--buchi-type=spotba'
LTSmin run took 1128 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLCardinality-10 finished in 9166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
[2022-05-16 07:26:16] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12661473849077712849
[2022-05-16 07:26:16] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2022-05-16 07:26:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:26:16] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2022-05-16 07:26:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:26:16] [INFO ] Applying decomposition
[2022-05-16 07:26:16] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:26:16] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2022-05-16 07:26:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:26:16] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12661473849077712849
Running compilation step : cd /tmp/ltsmin12661473849077712849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16888241548460795254.txt' '-o' '/tmp/graph16888241548460795254.bin' '-w' '/tmp/graph16888241548460795254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16888241548460795254.bin' '-l' '-1' '-v' '-w' '/tmp/graph16888241548460795254.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:26:16] [INFO ] Decomposing Gal with order
[2022-05-16 07:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:26:16] [INFO ] Flatten gal took : 22 ms
[2022-05-16 07:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 07:26:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality5252356007006488468.gal : 4 ms
[2022-05-16 07:26:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality9095168205283161519.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5252356007006488468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9095168205283161519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(gu95.Section_169<=gu95.Section_157)")))))
Formula 0 simplified : !XGF"(gu95.Section_169<=gu95.Section_157)"
Compilation finished in 870 ms.
Running link step : cd /tmp/ltsmin12661473849077712849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12661473849077712849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: LTL layer: formula: X([](<>((LTLAPp0==true))))
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: "X([](<>((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.111: DFS-FIFO for weak LTL, using special progress label 386
pins2lts-mc-linux64( 0/ 8), 0.112: There are 387 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.112: State length is 650, there are 387 groups
pins2lts-mc-linux64( 0/ 8), 0.112: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.112: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.112: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.112: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.764: ~1 levels ~960 states ~122872 transitions
pins2lts-mc-linux64( 5/ 8), 1.203: ~104 levels ~1920 states ~235176 transitions
pins2lts-mc-linux64( 3/ 8), 1.716: ~440 levels ~3840 states ~352064 transitions
pins2lts-mc-linux64( 7/ 8), 2.361: ~927 levels ~7680 states ~618080 transitions
pins2lts-mc-linux64( 1/ 8), 3.292: ~1819 levels ~15360 states ~1151632 transitions
pins2lts-mc-linux64( 1/ 8), 4.640: ~3670 levels ~30720 states ~2069096 transitions
pins2lts-mc-linux64( 1/ 8), 6.845: ~7390 levels ~61440 states ~3569160 transitions
pins2lts-mc-linux64( 1/ 8), 8.727: ~11481 levels ~122880 states ~4579680 transitions
pins2lts-mc-linux64( 1/ 8), 10.251: ~11481 levels ~245760 states ~4821232 transitions
pins2lts-mc-linux64( 1/ 8), 13.230: ~11481 levels ~491520 states ~5364792 transitions
pins2lts-mc-linux64( 1/ 8), 19.657: ~11481 levels ~983040 states ~6512864 transitions
pins2lts-mc-linux64( 1/ 8), 32.171: ~11481 levels ~1966080 states ~8850992 transitions
pins2lts-mc-linux64( 1/ 8), 57.895: ~11481 levels ~3932160 states ~13798096 transitions
pins2lts-mc-linux64( 1/ 8), 110.722: ~11481 levels ~7864320 states ~23925848 transitions
pins2lts-mc-linux64( 6/ 8), 120.936: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 120.995:
pins2lts-mc-linux64( 0/ 8), 120.995: mean standard work distribution: 13.3% (states) 12.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 120.995:
pins2lts-mc-linux64( 0/ 8), 120.995: Explored 7949633 states 25060148 transitions, fanout: 3.152
pins2lts-mc-linux64( 0/ 8), 120.995: Total exploration time 120.870 sec (120.800 sec minimum, 120.831 sec on average)
pins2lts-mc-linux64( 0/ 8), 120.995: States per second: 65770, Transitions per second: 207331
pins2lts-mc-linux64( 0/ 8), 120.995:
pins2lts-mc-linux64( 0/ 8), 120.995: Progress states detected: 373857
pins2lts-mc-linux64( 0/ 8), 120.995: Redundant explorations: -37.8979
pins2lts-mc-linux64( 0/ 8), 120.995:
pins2lts-mc-linux64( 0/ 8), 120.995: Queue width: 8B, total height: 472733, memory: 3.61MB
pins2lts-mc-linux64( 0/ 8), 120.995: Tree memory: 353.7MB, 29.0 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 120.995: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 120.995: Stored 386 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 120.995: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 120.995: Est. total memory use: 357.3MB (~1027.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12661473849077712849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12661473849077712849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 07:47:02] [INFO ] Flatten gal took : 18 ms
[2022-05-16 07:47:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality1355954840858502143.gal : 2 ms
[2022-05-16 07:47:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality11877514743545551205.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1355954840858502143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11877514743545551205.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(G(F("(Section_169<=Section_157)")))))
Formula 0 simplified : !XGF"(Section_169<=Section_157)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 08:07:49] [INFO ] Flatten gal took : 18 ms
[2022-05-16 08:07:49] [INFO ] Input system was already deterministic with 384 transitions.
[2022-05-16 08:07:49] [INFO ] Transformed 649 places.
[2022-05-16 08:07:49] [INFO ] Transformed 384 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 08:07:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality14561264811751830477.gal : 2 ms
[2022-05-16 08:07:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality1114611858941819841.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14561264811751830477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1114611858941819841.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F("(Section_169<=Section_157)")))))
Formula 0 simplified : !XGF"(Section_169<=Section_157)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

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

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