Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716842165196

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:36:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 20:36:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:36:07] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-27 20:36:07] [INFO ] Transformed 529 places.
[2024-05-27 20:36:07] [INFO ] Transformed 785 transitions.
[2024-05-27 20:36:07] [INFO ] Found NUPN structural information;
[2024-05-27 20:36:07] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 108 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2024-05-27 20:36:08] [INFO ] Computed 124 invariants in 35 ms
[2024-05-27 20:36:08] [INFO ] Implicit Places using invariants in 729 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 237, 245, 269, 271, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 775 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 486/529 places, 453/457 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 455 transition count 422
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 455 transition count 422
Applied a total of 62 rules in 65 ms. Remains 455 /486 variables (removed 31) and now considering 422/453 (removed 31) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:36:08] [INFO ] Computed 85 invariants in 4 ms
[2024-05-27 20:36:09] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-27 20:36:09] [INFO ] Invariant cache hit.
[2024-05-27 20:36:09] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:36:09] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/529 places, 422/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2035 ms. Remains : 455/529 places, 422/457 transitions.
Support contains 48 out of 455 places after structural reductions.
[2024-05-27 20:36:10] [INFO ] Flatten gal took : 102 ms
[2024-05-27 20:36:10] [INFO ] Flatten gal took : 45 ms
[2024-05-27 20:36:10] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 45 out of 455 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:36:11] [INFO ] Invariant cache hit.
[2024-05-27 20:36:11] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-05-27 20:36:11] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:36:11] [INFO ] [Nat]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-05-27 20:36:12] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:12] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:36:12] [INFO ] After 205ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:12] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 8 ms to minimize.
[2024-05-27 20:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-27 20:36:12] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-27 20:36:13] [INFO ] After 1366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 233 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=77 )
Parikh walk visited 6 properties in 63 ms.
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 455 transition count 407
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 440 transition count 407
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 440 transition count 391
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 424 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 74 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-05-27 20:36:13] [INFO ] Computed 85 invariants in 4 ms
[2024-05-27 20:36:13] [INFO ] Implicit Places using invariants in 289 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/455 places, 368/422 transitions.
Applied a total of 0 rules in 29 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 400/455 places, 368/422 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s254 1) (EQ s305 1)), p0:(AND (EQ s358 1) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 6 ms.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-01 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:36:14] [INFO ] Computed 85 invariants in 4 ms
[2024-05-27 20:36:14] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-27 20:36:14] [INFO ] Invariant cache hit.
[2024-05-27 20:36:14] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:36:15] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2024-05-27 20:36:15] [INFO ] Invariant cache hit.
[2024-05-27 20:36:15] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 455/455 places, 422/422 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s12 0), p0:(OR (AND (EQ s202 1) (EQ s237 1)) (AND (EQ s174 1) (EQ s240 1)))], 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, null][false, false, false]]
Product exploration explored 100000 steps with 2054 reset in 1019 ms.
Product exploration explored 100000 steps with 2054 reset in 864 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 481 steps, including 4 resets, run visited all 5 properties in 13 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 351 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 343 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 417 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 455 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 439 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 439 transition count 390
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 423 transition count 390
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 49 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-05-27 20:36:19] [INFO ] Computed 85 invariants in 3 ms
[2024-05-27 20:36:19] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-27 20:36:19] [INFO ] Invariant cache hit.
[2024-05-27 20:36:19] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-27 20:36:20] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2024-05-27 20:36:20] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-27 20:36:20] [INFO ] Invariant cache hit.
[2024-05-27 20:36:20] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/455 places, 368/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1399 ms. Remains : 401/455 places, 368/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 747 steps, including 7 resets, run visited all 5 properties in 6 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 406 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2073 reset in 730 ms.
Product exploration explored 100000 steps with 2085 reset in 762 ms.
Built C files in :
/tmp/ltsmin233963306906066628
[2024-05-27 20:36:24] [INFO ] Computing symmetric may disable matrix : 368 transitions.
[2024-05-27 20:36:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:24] [INFO ] Computing symmetric may enable matrix : 368 transitions.
[2024-05-27 20:36:24] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:24] [INFO ] Computing Do-Not-Accords matrix : 368 transitions.
[2024-05-27 20:36:24] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:24] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin233963306906066628
Running compilation step : cd /tmp/ltsmin233963306906066628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1252 ms.
Running link step : cd /tmp/ltsmin233963306906066628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin233963306906066628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12885290915391972012.hoa' '--buchi-type=spotba'
LTSmin run took 2989 ms.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-432-LTLFireability-02 finished in 14385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:36:28] [INFO ] Computed 85 invariants in 3 ms
[2024-05-27 20:36:28] [INFO ] Implicit Places using invariants in 323 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 18 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:36:29] [INFO ] Computed 84 invariants in 3 ms
[2024-05-27 20:36:29] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-27 20:36:29] [INFO ] Invariant cache hit.
[2024-05-27 20:36:29] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:36:30] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1396 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s286 1) (EQ s399 1))], 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]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-04 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 454 transition count 405
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 438 transition count 405
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 438 transition count 389
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 422 transition count 389
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 398 transition count 365
Applied a total of 112 rules in 40 ms. Remains 398 /455 variables (removed 57) and now considering 365/422 (removed 57) transitions.
// Phase 1: matrix 365 rows 398 cols
[2024-05-27 20:36:30] [INFO ] Computed 85 invariants in 2 ms
[2024-05-27 20:36:30] [INFO ] Implicit Places using invariants in 333 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 397/455 places, 365/422 transitions.
Applied a total of 0 rules in 15 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 397/455 places, 365/422 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s50 1) (EQ s87 1))) (NEQ s342 1)), p0:(AND (EQ s50 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 973 reset in 572 ms.
Product exploration explored 100000 steps with 958 reset in 671 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))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 1447 steps, including 13 resets, run visited all 2 properties in 24 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 15 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 397 cols
[2024-05-27 20:36:32] [INFO ] Computed 84 invariants in 2 ms
[2024-05-27 20:36:32] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-27 20:36:32] [INFO ] Invariant cache hit.
[2024-05-27 20:36:33] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-05-27 20:36:33] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-27 20:36:33] [INFO ] Invariant cache hit.
[2024-05-27 20:36:33] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1104 ms. Remains : 397/397 places, 365/365 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 2626 steps, including 23 resets, run visited all 2 properties in 24 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 961 reset in 503 ms.
Product exploration explored 100000 steps with 964 reset in 568 ms.
Built C files in :
/tmp/ltsmin6790207948495996299
[2024-05-27 20:36:35] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2024-05-27 20:36:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:35] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2024-05-27 20:36:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:35] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2024-05-27 20:36:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:35] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6790207948495996299
Running compilation step : cd /tmp/ltsmin6790207948495996299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1069 ms.
Running link step : cd /tmp/ltsmin6790207948495996299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6790207948495996299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased51944596491496640.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 18 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-05-27 20:36:50] [INFO ] Invariant cache hit.
[2024-05-27 20:36:50] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-27 20:36:50] [INFO ] Invariant cache hit.
[2024-05-27 20:36:51] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2024-05-27 20:36:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-27 20:36:51] [INFO ] Invariant cache hit.
[2024-05-27 20:36:51] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1248 ms. Remains : 397/397 places, 365/365 transitions.
Built C files in :
/tmp/ltsmin4160535907545990329
[2024-05-27 20:36:51] [INFO ] Computing symmetric may disable matrix : 365 transitions.
[2024-05-27 20:36:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:51] [INFO ] Computing symmetric may enable matrix : 365 transitions.
[2024-05-27 20:36:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:51] [INFO ] Computing Do-Not-Accords matrix : 365 transitions.
[2024-05-27 20:36:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:36:51] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4160535907545990329
Running compilation step : cd /tmp/ltsmin4160535907545990329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1189 ms.
Running link step : cd /tmp/ltsmin4160535907545990329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4160535907545990329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5144859025889501706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:37:06] [INFO ] Flatten gal took : 34 ms
[2024-05-27 20:37:07] [INFO ] Flatten gal took : 29 ms
[2024-05-27 20:37:07] [INFO ] Time to serialize gal into /tmp/LTL15313577334749835614.gal : 7 ms
[2024-05-27 20:37:07] [INFO ] Time to serialize properties into /tmp/LTL10208027163770321525.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15313577334749835614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17400096397973984397.hoa' '-atoms' '/tmp/LTL10208027163770321525.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10208027163770321525.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17400096397973984397.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:37:22] [INFO ] Flatten gal took : 27 ms
[2024-05-27 20:37:22] [INFO ] Flatten gal took : 30 ms
[2024-05-27 20:37:22] [INFO ] Time to serialize gal into /tmp/LTL8983872328595903566.gal : 4 ms
[2024-05-27 20:37:22] [INFO ] Time to serialize properties into /tmp/LTL11647535397619962618.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8983872328595903566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11647535397619962618.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((p51==1)&&(p111==1))"))U((G(!("((p51==1)&&(p111==1))")))||("((!((p51==1)&&(p111==1)))&&(p446!=1))"))))))
Formula 0 simplified : FG("((p51==1)&&(p111==1))" M !"((!((p51==1)&&(p111==1)))&&(p446!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:37:37] [INFO ] Flatten gal took : 22 ms
[2024-05-27 20:37:37] [INFO ] Applying decomposition
[2024-05-27 20:37:37] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16008790213096901479.txt' '-o' '/tmp/graph16008790213096901479.bin' '-w' '/tmp/graph16008790213096901479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16008790213096901479.bin' '-l' '-1' '-v' '-w' '/tmp/graph16008790213096901479.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:37:37] [INFO ] Decomposing Gal with order
[2024-05-27 20:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:37:37] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-27 20:37:37] [INFO ] Flatten gal took : 122 ms
[2024-05-27 20:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 21 ms.
[2024-05-27 20:37:37] [INFO ] Time to serialize gal into /tmp/LTL10191391803928315357.gal : 14 ms
[2024-05-27 20:37:37] [INFO ] Time to serialize properties into /tmp/LTL8588417245447129189.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10191391803928315357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8588417245447129189.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i3.u25.p51==1)&&(i5.u45.p111==1))"))U((G(!("((i3.u25.p51==1)&&(i5.u45.p111==1))")))||("((!((i3.u25.p51==1)&&(i5.u45.p111=...188
Formula 0 simplified : FG("((i3.u25.p51==1)&&(i5.u45.p111==1))" M !"((!((i3.u25.p51==1)&&(i5.u45.p111==1)))&&(i11.u134.p446!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
149 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.5676,65244,1,0,110686,1065,3126,253428,255,4907,131520
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLFireability-05 finished in 69390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p0 U p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:37:39] [INFO ] Computed 85 invariants in 2 ms
[2024-05-27 20:37:40] [INFO ] Implicit Places using invariants in 518 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 531 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 21 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:37:40] [INFO ] Computed 84 invariants in 4 ms
[2024-05-27 20:37:40] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-27 20:37:40] [INFO ] Invariant cache hit.
[2024-05-27 20:37:40] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:37:41] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2121 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s179 1), p1:(AND (EQ s241 1) (EQ s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 2303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(p0)) U p1)||F((G(p2)||p3)))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:37:41] [INFO ] Computed 85 invariants in 3 ms
[2024-05-27 20:37:42] [INFO ] Implicit Places using invariants in 517 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 519 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 19 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:37:42] [INFO ] Computed 84 invariants in 3 ms
[2024-05-27 20:37:42] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-27 20:37:42] [INFO ] Invariant cache hit.
[2024-05-27 20:37:43] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:37:44] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2217 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s387 1) (EQ s197 1)), p3:(EQ s316 0), p2:(EQ s387 1), p0:(AND (EQ s104 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 915 reset in 921 ms.
Product exploration explored 100000 steps with 908 reset in 670 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 161 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 273043 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 273043 steps, saw 47006 distinct states, run finished after 3003 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-27 20:37:50] [INFO ] Invariant cache hit.
[2024-05-27 20:37:50] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2024-05-27 20:37:50] [INFO ] [Nat]Absence check using 84 positive place invariants in 36 ms returned sat
[2024-05-27 20:37:51] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2024-05-27 20:37:51] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:37:51] [INFO ] After 299ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2024-05-27 20:37:51] [INFO ] After 717ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 263 ms.
[2024-05-27 20:37:52] [INFO ] After 1842ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 438 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 438 transition count 391
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 423 transition count 391
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 102 place count 402 transition count 370
Free-agglomeration rule applied 115 times.
Iterating global reduction 2 with 115 rules applied. Total rules applied 217 place count 402 transition count 255
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 2 with 115 rules applied. Total rules applied 332 place count 287 transition count 255
Applied a total of 332 rules in 99 ms. Remains 287 /453 variables (removed 166) and now considering 255/421 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 287/453 places, 255/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :5
Finished Best-First random walk after 1739 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=289 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p0))), (F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 9 factoid took 417 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 26 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-05-27 20:37:53] [INFO ] Invariant cache hit.
[2024-05-27 20:37:53] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-27 20:37:53] [INFO ] Invariant cache hit.
[2024-05-27 20:37:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:37:54] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2024-05-27 20:37:54] [INFO ] Invariant cache hit.
[2024-05-27 20:37:55] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2047 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:37:56] [INFO ] Invariant cache hit.
[2024-05-27 20:37:56] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:37:56] [INFO ] [Nat]Absence check using 84 positive place invariants in 35 ms returned sat
[2024-05-27 20:37:56] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:37:56] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:37:56] [INFO ] After 81ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:37:56] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-27 20:37:56] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 438 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 438 transition count 391
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 423 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 400 transition count 368
Free-agglomeration rule applied 116 times.
Iterating global reduction 2 with 116 rules applied. Total rules applied 222 place count 400 transition count 252
Reduce places removed 116 places and 0 transitions.
Graph (complete) has 582 edges and 284 vertex of which 148 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 2 with 117 rules applied. Total rules applied 339 place count 148 transition count 136
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 347 place count 148 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 147 transition count 127
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 122 edges and 103 vertex of which 93 / 103 are part of one of the 2 SCC in 4 ms
Free SCC test removed 91 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 48 rules applied. Total rules applied 396 place count 12 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 119 rules applied. Total rules applied 515 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 519 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 520 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 520 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 524 place count 4 transition count 4
Applied a total of 524 rules in 138 ms. Remains 4 /453 variables (removed 449) and now considering 4/421 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 4/453 places, 4/421 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) p2)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p3) (NOT p0))), (F (NOT p3))]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 907 reset in 734 ms.
Product exploration explored 100000 steps with 912 reset in 594 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 421
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 15 place count 453 transition count 421
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 30 place count 453 transition count 421
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 45 place count 438 transition count 406
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 60 place count 438 transition count 406
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 438 transition count 420
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 81 rules in 195 ms. Remains 438 /453 variables (removed 15) and now considering 420/421 (removed 1) transitions.
[2024-05-27 20:38:00] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 420 rows 438 cols
[2024-05-27 20:38:00] [INFO ] Computed 84 invariants in 3 ms
[2024-05-27 20:38:00] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 438/453 places, 420/421 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 743 ms. Remains : 438/453 places, 420/421 transitions.
Built C files in :
/tmp/ltsmin10828564256825758851
[2024-05-27 20:38:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10828564256825758851
Running compilation step : cd /tmp/ltsmin10828564256825758851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin10828564256825758851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10828564256825758851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7148065002169737852.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:38:15] [INFO ] Computed 84 invariants in 2 ms
[2024-05-27 20:38:16] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-27 20:38:16] [INFO ] Invariant cache hit.
[2024-05-27 20:38:16] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:38:17] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2024-05-27 20:38:17] [INFO ] Invariant cache hit.
[2024-05-27 20:38:17] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1809 ms. Remains : 453/453 places, 421/421 transitions.
Built C files in :
/tmp/ltsmin5497880939121695450
[2024-05-27 20:38:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5497880939121695450
Running compilation step : cd /tmp/ltsmin5497880939121695450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1160 ms.
Running link step : cd /tmp/ltsmin5497880939121695450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5497880939121695450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13086677873221959805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:38:32] [INFO ] Flatten gal took : 21 ms
[2024-05-27 20:38:32] [INFO ] Flatten gal took : 20 ms
[2024-05-27 20:38:32] [INFO ] Time to serialize gal into /tmp/LTL17977404762889293746.gal : 5 ms
[2024-05-27 20:38:32] [INFO ] Time to serialize properties into /tmp/LTL3594424903214965065.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17977404762889293746.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15671061733679361274.hoa' '-atoms' '/tmp/LTL3594424903214965065.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3594424903214965065.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15671061733679361274.hoa
Detected timeout of ITS tools.
[2024-05-27 20:38:47] [INFO ] Flatten gal took : 19 ms
[2024-05-27 20:38:47] [INFO ] Flatten gal took : 19 ms
[2024-05-27 20:38:47] [INFO ] Time to serialize gal into /tmp/LTL2371606271343939279.gal : 3 ms
[2024-05-27 20:38:47] [INFO ] Time to serialize properties into /tmp/LTL4123022620931364275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2371606271343939279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4123022620931364275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((X(X("((p118==1)&&(p150==1))")))U("((p446==1)||(p226==1))"))||(F((G("(p446==1)"))||("(p368==0)"))))))
Formula 0 simplified : F(!"((p446==1)||(p226==1))" & G(!"(p368==0)" & F!"(p446==1)") & X(!"((p446==1)||(p226==1))" W X!"((p118==1)&&(p150==1))"))
Detected timeout of ITS tools.
[2024-05-27 20:39:02] [INFO ] Flatten gal took : 16 ms
[2024-05-27 20:39:02] [INFO ] Applying decomposition
[2024-05-27 20:39:02] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2609800590737657071.txt' '-o' '/tmp/graph2609800590737657071.bin' '-w' '/tmp/graph2609800590737657071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2609800590737657071.bin' '-l' '-1' '-v' '-w' '/tmp/graph2609800590737657071.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:39:02] [INFO ] Decomposing Gal with order
[2024-05-27 20:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:39:03] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-27 20:39:03] [INFO ] Flatten gal took : 43 ms
[2024-05-27 20:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-27 20:39:03] [INFO ] Time to serialize gal into /tmp/LTL9884366173030611588.gal : 8 ms
[2024-05-27 20:39:03] [INFO ] Time to serialize properties into /tmp/LTL12051093324658722230.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9884366173030611588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12051093324658722230.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((X(X("((i4.u36.p118==1)&&(i4.u47.p150==1))")))U("((i12.u136.p446==1)||(i6.u70.p226==1))"))||(F((G("(i12.u136.p446==1)"))||("(i11...182
Formula 0 simplified : F(!"((i12.u136.p446==1)||(i6.u70.p226==1))" & G(!"(i11.i1.i2.u107.p368==0)" & F!"(i12.u136.p446==1)") & X(!"((i12.u136.p446==1)||(i6...215
Reverse transition relation is NOT exact ! Due to transitions i4.u47.t104, i6.u83.t70, i11.i1.i2.u118.t36, i12.u152.t2, Intersection with reachable at eac...219
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
83 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.916084,37692,1,0,45584,7720,6767,69740,833,19154,80328
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-LTLFireability-07 finished in 82271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(G((p1||G(p2)))))))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 454 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 439 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 439 transition count 391
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 424 transition count 391
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 110 place count 399 transition count 366
Applied a total of 110 rules in 27 ms. Remains 399 /455 variables (removed 56) and now considering 366/422 (removed 56) transitions.
// Phase 1: matrix 366 rows 399 cols
[2024-05-27 20:39:04] [INFO ] Computed 85 invariants in 1 ms
[2024-05-27 20:39:04] [INFO ] Implicit Places using invariants in 301 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 303 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/455 places, 366/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 398/455 places, 366/422 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s347 1), p0:(AND (EQ s218 1) (EQ s294 1)), p2:(OR (NEQ s48 1) (NEQ s112 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 950 reset in 678 ms.
Product exploration explored 100000 steps with 948 reset in 870 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) p2), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 250 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 366 rows 398 cols
[2024-05-27 20:39:07] [INFO ] Computed 84 invariants in 1 ms
[2024-05-27 20:39:07] [INFO ] [Real]Absence check using 84 positive place invariants in 34 ms returned sat
[2024-05-27 20:39:07] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:39:07] [INFO ] [Nat]Absence check using 84 positive place invariants in 27 ms returned sat
[2024-05-27 20:39:08] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:39:08] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-27 20:39:08] [INFO ] After 674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 366/366 transitions.
Free-agglomeration rule applied 114 times.
Iterating global reduction 0 with 114 rules applied. Total rules applied 114 place count 398 transition count 252
Reduce places removed 192 places and 0 transitions.
Graph (complete) has 260 edges and 206 vertex of which 156 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 62 output transitions
Drop transitions removed 62 transitions
Graph (trivial) has 180 edges and 156 vertex of which 99 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 96 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 237 rules applied. Total rules applied 351 place count 60 transition count 147
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 174 rules applied. Total rules applied 525 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 526 place count 16 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 526 place count 16 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 528 place count 15 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 532 place count 13 transition count 13
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 535 place count 13 transition count 10
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 540 place count 10 transition count 8
Applied a total of 540 rules in 34 ms. Remains 10 /398 variables (removed 388) and now considering 8/366 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/398 places, 8/366 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 673 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 13 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-27 20:39:09] [INFO ] Invariant cache hit.
[2024-05-27 20:39:10] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-27 20:39:10] [INFO ] Invariant cache hit.
[2024-05-27 20:39:10] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2024-05-27 20:39:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:39:10] [INFO ] Invariant cache hit.
[2024-05-27 20:39:11] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1500 ms. Remains : 398/398 places, 366/366 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 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 225 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:39:11] [INFO ] Invariant cache hit.
[2024-05-27 20:39:12] [INFO ] [Real]Absence check using 84 positive place invariants in 34 ms returned sat
[2024-05-27 20:39:12] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:39:12] [INFO ] [Nat]Absence check using 84 positive place invariants in 28 ms returned sat
[2024-05-27 20:39:12] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:39:12] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-27 20:39:12] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 798 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 949 reset in 767 ms.
Product exploration explored 100000 steps with 947 reset in 611 ms.
Built C files in :
/tmp/ltsmin12751058362819786250
[2024-05-27 20:39:15] [INFO ] Computing symmetric may disable matrix : 366 transitions.
[2024-05-27 20:39:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:39:15] [INFO ] Computing symmetric may enable matrix : 366 transitions.
[2024-05-27 20:39:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:39:15] [INFO ] Computing Do-Not-Accords matrix : 366 transitions.
[2024-05-27 20:39:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:39:15] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12751058362819786250
Running compilation step : cd /tmp/ltsmin12751058362819786250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1081 ms.
Running link step : cd /tmp/ltsmin12751058362819786250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12751058362819786250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5307189008753309415.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-27 20:39:30] [INFO ] Invariant cache hit.
[2024-05-27 20:39:31] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-27 20:39:31] [INFO ] Invariant cache hit.
[2024-05-27 20:39:31] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2024-05-27 20:39:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:39:31] [INFO ] Invariant cache hit.
[2024-05-27 20:39:32] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1417 ms. Remains : 398/398 places, 366/366 transitions.
Built C files in :
/tmp/ltsmin9498826282380993645
[2024-05-27 20:39:32] [INFO ] Computing symmetric may disable matrix : 366 transitions.
[2024-05-27 20:39:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:39:32] [INFO ] Computing symmetric may enable matrix : 366 transitions.
[2024-05-27 20:39:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:39:32] [INFO ] Computing Do-Not-Accords matrix : 366 transitions.
[2024-05-27 20:39:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:39:32] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9498826282380993645
Running compilation step : cd /tmp/ltsmin9498826282380993645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1397 ms.
Running link step : cd /tmp/ltsmin9498826282380993645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9498826282380993645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14186920175891608807.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:39:47] [INFO ] Flatten gal took : 12 ms
[2024-05-27 20:39:47] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:39:47] [INFO ] Time to serialize gal into /tmp/LTL7932288008810737724.gal : 5 ms
[2024-05-27 20:39:47] [INFO ] Time to serialize properties into /tmp/LTL313144818578172255.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7932288008810737724.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9588694432133569708.hoa' '-atoms' '/tmp/LTL313144818578172255.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL313144818578172255.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9588694432133569708.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1059 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6571,271440,1,0,123,1.66121e+06,37,150,9534,615211,267
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-432-LTLFireability-09 finished in 55214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||X(p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:39:59] [INFO ] Computed 85 invariants in 1 ms
[2024-05-27 20:39:59] [INFO ] Implicit Places using invariants in 331 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 14 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:39:59] [INFO ] Computed 84 invariants in 2 ms
[2024-05-27 20:40:00] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-27 20:40:00] [INFO ] Invariant cache hit.
[2024-05-27 20:40:00] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:40:01] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1979 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(AND (EQ s425 1) (EQ s452 1)), p1:(EQ s209 1)], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-11 finished in 2223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U p0))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:40:01] [INFO ] Computed 85 invariants in 2 ms
[2024-05-27 20:40:01] [INFO ] Implicit Places using invariants in 378 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 19 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:40:01] [INFO ] Computed 84 invariants in 3 ms
[2024-05-27 20:40:02] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-27 20:40:02] [INFO ] Invariant cache hit.
[2024-05-27 20:40:02] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:40:03] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1924 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s32 1), p1:(AND (EQ s265 1) (EQ s313 1))], 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, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 2054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!X(F(p1)) U p2)&&G(p3))||p0))))'
Support contains 7 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:40:03] [INFO ] Computed 85 invariants in 3 ms
[2024-05-27 20:40:04] [INFO ] Implicit Places using invariants in 421 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 17 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:40:04] [INFO ] Computed 84 invariants in 2 ms
[2024-05-27 20:40:04] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-27 20:40:04] [INFO ] Invariant cache hit.
[2024-05-27 20:40:05] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:40:05] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2015 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (EQ s242 1) (EQ s323 1)) (AND (EQ s169 1) (EQ s237 1))), p3:(EQ s316 1), p2:(AND (EQ s149 1) (EQ s190 1)), p1:(AND (EQ s169 1) (EQ s237 1))], 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]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-13 finished in 2421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-27 20:40:06] [INFO ] Computed 85 invariants in 3 ms
[2024-05-27 20:40:06] [INFO ] Implicit Places using invariants in 427 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 19 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-27 20:40:06] [INFO ] Computed 84 invariants in 3 ms
[2024-05-27 20:40:06] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-27 20:40:06] [INFO ] Invariant cache hit.
[2024-05-27 20:40:07] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-27 20:40:08] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2059 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (EQ s52 1) (EQ s115 1)) (AND (EQ s388 1) (EQ s452 1))), p1:(AND (EQ s52 1) (EQ s115 1))], 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 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 2243 ms.
All properties solved by simple procedures.
Total runtime 240814 ms.

BK_STOP 1716842409477

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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