Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 251K Mar 5 18:23 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-832-LTLFireability-00
FORMULA_NAME Parking-PT-832-LTLFireability-01
FORMULA_NAME Parking-PT-832-LTLFireability-02
FORMULA_NAME Parking-PT-832-LTLFireability-03
FORMULA_NAME Parking-PT-832-LTLFireability-04
FORMULA_NAME Parking-PT-832-LTLFireability-05
FORMULA_NAME Parking-PT-832-LTLFireability-06
FORMULA_NAME Parking-PT-832-LTLFireability-07
FORMULA_NAME Parking-PT-832-LTLFireability-08
FORMULA_NAME Parking-PT-832-LTLFireability-09
FORMULA_NAME Parking-PT-832-LTLFireability-10
FORMULA_NAME Parking-PT-832-LTLFireability-11
FORMULA_NAME Parking-PT-832-LTLFireability-12
FORMULA_NAME Parking-PT-832-LTLFireability-13
FORMULA_NAME Parking-PT-832-LTLFireability-14
FORMULA_NAME Parking-PT-832-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678933298882

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 02:21:42] [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]
[2023-03-16 02:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:21:42] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-16 02:21:42] [INFO ] Transformed 737 places.
[2023-03-16 02:21:42] [INFO ] Transformed 993 transitions.
[2023-03-16 02:21:42] [INFO ] Found NUPN structural information;
[2023-03-16 02:21:42] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 732 transition count 604
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 732 transition count 604
Applied a total of 10 rules in 179 ms. Remains 732 /737 variables (removed 5) and now considering 604/609 (removed 5) transitions.
// Phase 1: matrix 604 rows 732 cols
[2023-03-16 02:21:43] [INFO ] Computed 184 place invariants in 34 ms
[2023-03-16 02:21:44] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2023-03-16 02:21:44] [INFO ] Invariant cache hit.
[2023-03-16 02:21:44] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 02:21:46] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned [136, 144, 152, 160, 184, 214, 222, 230, 238, 262, 264, 291, 299, 307, 315, 339, 341, 369, 377, 385, 393, 417, 419, 446, 454, 462, 470, 494, 496, 523, 531, 539, 547, 571, 573, 600, 608, 616, 624, 648, 650, 678, 686, 694, 702, 726, 728]
Discarding 47 places :
Implicit Place search using SMT with State Equation took 3191 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/737 places, 604/609 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 654 transition count 573
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 654 transition count 573
Applied a total of 62 rules in 142 ms. Remains 654 /685 variables (removed 31) and now considering 573/604 (removed 31) transitions.
// Phase 1: matrix 573 rows 654 cols
[2023-03-16 02:21:46] [INFO ] Computed 137 place invariants in 7 ms
[2023-03-16 02:21:47] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-16 02:21:47] [INFO ] Invariant cache hit.
[2023-03-16 02:21:47] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 02:21:48] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 654/737 places, 573/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5689 ms. Remains : 654/737 places, 573/609 transitions.
Support contains 32 out of 654 places after structural reductions.
[2023-03-16 02:21:49] [INFO ] Flatten gal took : 168 ms
[2023-03-16 02:21:49] [INFO ] Flatten gal took : 90 ms
[2023-03-16 02:21:49] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 788 ms. (steps per millisecond=12 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-16 02:21:50] [INFO ] Invariant cache hit.
[2023-03-16 02:21:51] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-16 02:21:51] [INFO ] [Nat]Absence check using 137 positive place invariants in 44 ms returned sat
[2023-03-16 02:21:52] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-16 02:21:52] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 02:21:53] [INFO ] After 735ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-16 02:21:53] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 9 ms to minimize.
[2023-03-16 02:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-16 02:21:54] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2023-03-16 02:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-16 02:21:54] [INFO ] After 1946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 669 ms.
[2023-03-16 02:21:55] [INFO ] After 4065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 9 properties in 475 ms.
Support contains 7 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 622 transition count 541
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 618 transition count 537
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 618 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 134 place count 587 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 586 transition count 509
Free-agglomeration rule applied 159 times.
Iterating global reduction 2 with 159 rules applied. Total rules applied 295 place count 586 transition count 350
Reduce places removed 159 places and 0 transitions.
Graph (complete) has 835 edges and 427 vertex of which 286 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.3 ms
Discarding 141 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Iterating post reduction 2 with 160 rules applied. Total rules applied 455 place count 286 transition count 254
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 485 place count 286 transition count 224
Applied a total of 485 rules in 368 ms. Remains 286 /654 variables (removed 368) and now considering 224/573 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 286/654 places, 224/573 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
Finished Best-First random walk after 1339 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=267 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 63 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-16 02:21:56] [INFO ] Computed 137 place invariants in 5 ms
[2023-03-16 02:21:57] [INFO ] Implicit Places using invariants in 744 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 746 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 13 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 822 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 462 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s463 1), p0:(EQ s479 0)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2646 ms.
Product exploration explored 100000 steps with 50000 reset in 2139 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) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 7 factoid took 382 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-02 finished in 6568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(p2))))'
Support contains 3 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 32 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
[2023-03-16 02:22:03] [INFO ] Invariant cache hit.
[2023-03-16 02:22:03] [INFO ] Implicit Places using invariants in 552 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 555 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 25 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 614 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(AND (EQ s260 1) (EQ s282 1)), p1:(AND (EQ s18 1) (EQ s260 1) (EQ s282 1)), p0:(EQ s18 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
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 622 transition count 541
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 618 transition count 537
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 618 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 134 place count 587 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 586 transition count 509
Applied a total of 136 rules in 180 ms. Remains 586 /654 variables (removed 68) and now considering 509/573 (removed 64) transitions.
// Phase 1: matrix 509 rows 586 cols
[2023-03-16 02:22:04] [INFO ] Computed 137 place invariants in 4 ms
[2023-03-16 02:22:04] [INFO ] Implicit Places using invariants in 595 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 598 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/654 places, 509/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 584 transition count 524
Applied a total of 2 rules in 72 ms. Remains 584 /585 variables (removed 1) and now considering 524/509 (removed -15) transitions.
// Phase 1: matrix 524 rows 584 cols
[2023-03-16 02:22:05] [INFO ] Computed 136 place invariants in 3 ms
[2023-03-16 02:22:05] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-16 02:22:05] [INFO ] Invariant cache hit.
[2023-03-16 02:22:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-16 02:22:07] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/654 places, 524/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3020 ms. Remains : 584/654 places, 524/573 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s420 1) (EQ s437 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 5 ms.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-04 finished in 3161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 653 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 556
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 637 transition count 540
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 621 transition count 540
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 617 transition count 536
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 617 transition count 536
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 134 place count 586 transition count 505
Applied a total of 134 rules in 114 ms. Remains 586 /654 variables (removed 68) and now considering 505/573 (removed 68) transitions.
// Phase 1: matrix 505 rows 586 cols
[2023-03-16 02:22:07] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-16 02:22:08] [INFO ] Implicit Places using invariants in 588 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 590 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/654 places, 505/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 584 transition count 504
Applied a total of 2 rules in 42 ms. Remains 584 /585 variables (removed 1) and now considering 504/505 (removed 1) transitions.
// Phase 1: matrix 504 rows 584 cols
[2023-03-16 02:22:08] [INFO ] Computed 136 place invariants in 3 ms
[2023-03-16 02:22:08] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-16 02:22:08] [INFO ] Invariant cache hit.
[2023-03-16 02:22:09] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1443 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/654 places, 504/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2191 ms. Remains : 584/654 places, 504/573 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s352 1) (NEQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 514 reset in 1043 ms.
Product exploration explored 100000 steps with 513 reset in 1028 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 166 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 504/504 transitions.
Applied a total of 0 rules in 26 ms. Remains 584 /584 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2023-03-16 02:22:12] [INFO ] Invariant cache hit.
[2023-03-16 02:22:12] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-16 02:22:12] [INFO ] Invariant cache hit.
[2023-03-16 02:22:13] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2023-03-16 02:22:13] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-16 02:22:13] [INFO ] Invariant cache hit.
[2023-03-16 02:22:14] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2485 ms. Remains : 584/584 places, 504/504 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 374 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 512 reset in 1131 ms.
Product exploration explored 100000 steps with 513 reset in 869 ms.
Built C files in :
/tmp/ltsmin13179228131039314558
[2023-03-16 02:22:17] [INFO ] Computing symmetric may disable matrix : 504 transitions.
[2023-03-16 02:22:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:22:17] [INFO ] Computing symmetric may enable matrix : 504 transitions.
[2023-03-16 02:22:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:22:17] [INFO ] Computing Do-Not-Accords matrix : 504 transitions.
[2023-03-16 02:22:17] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:22:17] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13179228131039314558
Running compilation step : cd /tmp/ltsmin13179228131039314558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2402 ms.
Running link step : cd /tmp/ltsmin13179228131039314558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin13179228131039314558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15576176159290039042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 504/504 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2023-03-16 02:22:32] [INFO ] Invariant cache hit.
[2023-03-16 02:22:33] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-16 02:22:33] [INFO ] Invariant cache hit.
[2023-03-16 02:22:34] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
[2023-03-16 02:22:34] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 02:22:34] [INFO ] Invariant cache hit.
[2023-03-16 02:22:34] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2470 ms. Remains : 584/584 places, 504/504 transitions.
Built C files in :
/tmp/ltsmin10161880602252772632
[2023-03-16 02:22:35] [INFO ] Computing symmetric may disable matrix : 504 transitions.
[2023-03-16 02:22:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:22:35] [INFO ] Computing symmetric may enable matrix : 504 transitions.
[2023-03-16 02:22:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:22:35] [INFO ] Computing Do-Not-Accords matrix : 504 transitions.
[2023-03-16 02:22:35] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:22:35] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10161880602252772632
Running compilation step : cd /tmp/ltsmin10161880602252772632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1932 ms.
Running link step : cd /tmp/ltsmin10161880602252772632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin10161880602252772632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11798080089136000413.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 02:22:50] [INFO ] Flatten gal took : 38 ms
[2023-03-16 02:22:50] [INFO ] Flatten gal took : 33 ms
[2023-03-16 02:22:50] [INFO ] Time to serialize gal into /tmp/LTL4836225492012029218.gal : 9 ms
[2023-03-16 02:22:50] [INFO ] Time to serialize properties into /tmp/LTL3362286329317143204.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4836225492012029218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16425245237719901368.hoa' '-atoms' '/tmp/LTL3362286329317143204.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3362286329317143204.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16425245237719901368.hoa
Detected timeout of ITS tools.
[2023-03-16 02:23:05] [INFO ] Flatten gal took : 48 ms
[2023-03-16 02:23:05] [INFO ] Flatten gal took : 47 ms
[2023-03-16 02:23:05] [INFO ] Time to serialize gal into /tmp/LTL4116309978743263553.gal : 8 ms
[2023-03-16 02:23:05] [INFO ] Time to serialize properties into /tmp/LTL1432263179692091674.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4116309978743263553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1432263179692091674.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p429!=1)||(p493!=1))"))))
Formula 0 simplified : GF!"((p429!=1)||(p493!=1))"
Detected timeout of ITS tools.
[2023-03-16 02:23:20] [INFO ] Flatten gal took : 42 ms
[2023-03-16 02:23:20] [INFO ] Applying decomposition
[2023-03-16 02:23:20] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15395990001220817078.txt' '-o' '/tmp/graph15395990001220817078.bin' '-w' '/tmp/graph15395990001220817078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15395990001220817078.bin' '-l' '-1' '-v' '-w' '/tmp/graph15395990001220817078.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:23:20] [INFO ] Decomposing Gal with order
[2023-03-16 02:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:23:21] [INFO ] Removed a total of 112 redundant transitions.
[2023-03-16 02:23:21] [INFO ] Flatten gal took : 158 ms
[2023-03-16 02:23:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 27 ms.
[2023-03-16 02:23:21] [INFO ] Time to serialize gal into /tmp/LTL17614235677889684356.gal : 22 ms
[2023-03-16 02:23:21] [INFO ] Time to serialize properties into /tmp/LTL13904723361300092566.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17614235677889684356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13904723361300092566.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i9.u146.p429!=1)||(i9.u164.p493!=1))"))))
Formula 0 simplified : GF!"((i9.u146.p429!=1)||(i9.u164.p493!=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5512629439083777878
[2023-03-16 02:23:36] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5512629439083777878
Running compilation step : cd /tmp/ltsmin5512629439083777878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1187 ms.
Running link step : cd /tmp/ltsmin5512629439083777878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5512629439083777878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-832-LTLFireability-05 finished in 104059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 653 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 637 transition count 556
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 637 transition count 540
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 621 transition count 540
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 618 transition count 537
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 618 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 132 place count 587 transition count 506
Applied a total of 132 rules in 112 ms. Remains 587 /654 variables (removed 67) and now considering 506/573 (removed 67) transitions.
// Phase 1: matrix 506 rows 587 cols
[2023-03-16 02:23:51] [INFO ] Computed 137 place invariants in 4 ms
[2023-03-16 02:23:52] [INFO ] Implicit Places using invariants in 769 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 770 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/654 places, 506/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 585 transition count 505
Applied a total of 2 rules in 49 ms. Remains 585 /586 variables (removed 1) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 585 cols
[2023-03-16 02:23:52] [INFO ] Computed 136 place invariants in 3 ms
[2023-03-16 02:23:53] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-16 02:23:53] [INFO ] Invariant cache hit.
[2023-03-16 02:23:54] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/654 places, 505/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2709 ms. Remains : 585/654 places, 505/573 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s287 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 2885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
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 622 transition count 541
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 618 transition count 537
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 618 transition count 537
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 589 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 588 transition count 511
Applied a total of 132 rules in 119 ms. Remains 588 /654 variables (removed 66) and now considering 511/573 (removed 62) transitions.
// Phase 1: matrix 511 rows 588 cols
[2023-03-16 02:23:54] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-16 02:23:55] [INFO ] Implicit Places using invariants in 830 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 837 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 511/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 526
Applied a total of 2 rules in 63 ms. Remains 586 /587 variables (removed 1) and now considering 526/511 (removed -15) transitions.
// Phase 1: matrix 526 rows 586 cols
[2023-03-16 02:23:55] [INFO ] Computed 136 place invariants in 4 ms
[2023-03-16 02:23:55] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-16 02:23:55] [INFO ] Invariant cache hit.
[2023-03-16 02:23:56] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-16 02:23:57] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 526/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3282 ms. Remains : 586/654 places, 526/573 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s70 1) (EQ s389 1)), p2:(NEQ s248 1), p1:(NEQ s485 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 516 reset in 1409 ms.
Product exploration explored 100000 steps with 514 reset in 1125 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 774 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 02:24:01] [INFO ] Invariant cache hit.
[2023-03-16 02:24:02] [INFO ] [Real]Absence check using 136 positive place invariants in 32 ms returned sat
[2023-03-16 02:24:02] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 02:24:03] [INFO ] [Nat]Absence check using 136 positive place invariants in 61 ms returned sat
[2023-03-16 02:24:03] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 02:24:03] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-16 02:24:04] [INFO ] After 235ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 02:24:04] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-16 02:24:04] [INFO ] After 1738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 54 ms.
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 526/526 transitions.
Free-agglomeration rule applied 162 times.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 586 transition count 364
Reduce places removed 162 places and 0 transitions.
Graph (complete) has 855 edges and 424 vertex of which 228 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions removed 156 transitions
Iterating post reduction 0 with 163 rules applied. Total rules applied 325 place count 228 transition count 208
Drop transitions removed 32 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 361 place count 228 transition count 172
Applied a total of 361 rules in 41 ms. Remains 228 /586 variables (removed 358) and now considering 172/526 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 228/586 places, 172/526 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
Finished Best-First random walk after 788 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=197 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 1137 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 526/526 transitions.
Applied a total of 0 rules in 21 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2023-03-16 02:24:06] [INFO ] Invariant cache hit.
[2023-03-16 02:24:06] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-16 02:24:06] [INFO ] Invariant cache hit.
[2023-03-16 02:24:07] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-16 02:24:08] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2023-03-16 02:24:08] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 02:24:08] [INFO ] Invariant cache hit.
[2023-03-16 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2973 ms. Remains : 586/586 places, 526/526 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 784 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 02:24:10] [INFO ] Invariant cache hit.
[2023-03-16 02:24:10] [INFO ] [Real]Absence check using 136 positive place invariants in 63 ms returned sat
[2023-03-16 02:24:11] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 02:24:11] [INFO ] [Nat]Absence check using 136 positive place invariants in 56 ms returned sat
[2023-03-16 02:24:12] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 02:24:12] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-16 02:24:12] [INFO ] After 258ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 02:24:13] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-16 02:24:13] [INFO ] After 1788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 84 ms.
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 526/526 transitions.
Free-agglomeration rule applied 162 times.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 586 transition count 364
Reduce places removed 162 places and 0 transitions.
Graph (complete) has 855 edges and 424 vertex of which 228 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions removed 156 transitions
Iterating post reduction 0 with 163 rules applied. Total rules applied 325 place count 228 transition count 208
Drop transitions removed 32 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 361 place count 228 transition count 172
Applied a total of 361 rules in 62 ms. Remains 228 /586 variables (removed 358) and now considering 172/526 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 228/586 places, 172/526 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :2
Finished Best-First random walk after 514 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=257 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 971 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 513 reset in 1327 ms.
Product exploration explored 100000 steps with 512 reset in 946 ms.
Built C files in :
/tmp/ltsmin8642339668202425216
[2023-03-16 02:24:17] [INFO ] Computing symmetric may disable matrix : 526 transitions.
[2023-03-16 02:24:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:24:17] [INFO ] Computing symmetric may enable matrix : 526 transitions.
[2023-03-16 02:24:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:24:17] [INFO ] Computing Do-Not-Accords matrix : 526 transitions.
[2023-03-16 02:24:17] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:24:17] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8642339668202425216
Running compilation step : cd /tmp/ltsmin8642339668202425216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1993 ms.
Running link step : cd /tmp/ltsmin8642339668202425216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin8642339668202425216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5856148059167480111.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 526/526 transitions.
Applied a total of 0 rules in 22 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2023-03-16 02:24:32] [INFO ] Invariant cache hit.
[2023-03-16 02:24:33] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-16 02:24:33] [INFO ] Invariant cache hit.
[2023-03-16 02:24:33] [INFO ] State equation strengthened by 218 read => feed constraints.
[2023-03-16 02:24:34] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
[2023-03-16 02:24:34] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 02:24:34] [INFO ] Invariant cache hit.
[2023-03-16 02:24:35] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2914 ms. Remains : 586/586 places, 526/526 transitions.
Built C files in :
/tmp/ltsmin17360036533596135324
[2023-03-16 02:24:35] [INFO ] Computing symmetric may disable matrix : 526 transitions.
[2023-03-16 02:24:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:24:35] [INFO ] Computing symmetric may enable matrix : 526 transitions.
[2023-03-16 02:24:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:24:35] [INFO ] Computing Do-Not-Accords matrix : 526 transitions.
[2023-03-16 02:24:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:24:35] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17360036533596135324
Running compilation step : cd /tmp/ltsmin17360036533596135324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2337 ms.
Running link step : cd /tmp/ltsmin17360036533596135324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin17360036533596135324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14694156059263411649.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 02:24:50] [INFO ] Flatten gal took : 44 ms
[2023-03-16 02:24:50] [INFO ] Flatten gal took : 33 ms
[2023-03-16 02:24:50] [INFO ] Time to serialize gal into /tmp/LTL3964838462269700199.gal : 5 ms
[2023-03-16 02:24:50] [INFO ] Time to serialize properties into /tmp/LTL15167447622034075482.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3964838462269700199.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12661957019316966206.hoa' '-atoms' '/tmp/LTL15167447622034075482.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15167447622034075482.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12661957019316966206.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2023-03-16 02:25:05] [INFO ] Flatten gal took : 28 ms
[2023-03-16 02:25:05] [INFO ] Flatten gal took : 28 ms
[2023-03-16 02:25:05] [INFO ] Time to serialize gal into /tmp/LTL12244933015662492801.gal : 4 ms
[2023-03-16 02:25:05] [INFO ] Time to serialize properties into /tmp/LTL8851821100252714692.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12244933015662492801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8851821100252714692.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("((p70==1)&&(p480==1))")&&(F("(p600!=1)"))))||(G("(p288!=1)")))))
Formula 0 simplified : G(F(!"((p70==1)&&(p480==1))" | G!"(p600!=1)") & F!"(p288!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2023-03-16 02:25:20] [INFO ] Flatten gal took : 28 ms
[2023-03-16 02:25:20] [INFO ] Applying decomposition
[2023-03-16 02:25:20] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15005264720854671926.txt' '-o' '/tmp/graph15005264720854671926.bin' '-w' '/tmp/graph15005264720854671926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15005264720854671926.bin' '-l' '-1' '-v' '-w' '/tmp/graph15005264720854671926.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:25:21] [INFO ] Decomposing Gal with order
[2023-03-16 02:25:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:25:21] [INFO ] Removed a total of 706 redundant transitions.
[2023-03-16 02:25:21] [INFO ] Flatten gal took : 87 ms
[2023-03-16 02:25:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 56 ms.
[2023-03-16 02:25:21] [INFO ] Time to serialize gal into /tmp/LTL2209348075926042980.gal : 9 ms
[2023-03-16 02:25:21] [INFO ] Time to serialize properties into /tmp/LTL10078401834531178106.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2209348075926042980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10078401834531178106.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("((i9.i0.i2.u34.p70==1)&&(i9.i0.i2.u159.p480==1))")&&(F("(i13.u199.p600!=1)"))))||(G("(i6.u106.p288!=1)")))))
Formula 0 simplified : G(F(!"((i9.i0.i2.u34.p70==1)&&(i9.i0.i2.u159.p480==1))" | G!"(i13.u199.p600!=1)") & F!"(i6.u106.p288!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
6 unique states visited
3 strongly connected components in search stack
11 transitions explored
6 items max in DFS search stack
1271 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,12.8299,337144,1,0,614267,516,5637,1.82177e+06,202,1187,499020
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLFireability-07 finished in 101716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(G(p0)||G(p1))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 654 transition count 557
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 638 transition count 557
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 638 transition count 541
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 622 transition count 541
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 619 transition count 538
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 619 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 589 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 588 transition count 527
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 588 transition count 527
Applied a total of 133 rules in 82 ms. Remains 588 /654 variables (removed 66) and now considering 527/573 (removed 46) transitions.
// Phase 1: matrix 527 rows 588 cols
[2023-03-16 02:25:36] [INFO ] Computed 137 place invariants in 2 ms
[2023-03-16 02:25:36] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-16 02:25:36] [INFO ] Invariant cache hit.
[2023-03-16 02:25:37] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-16 02:25:38] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2023-03-16 02:25:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 02:25:38] [INFO ] Invariant cache hit.
[2023-03-16 02:25:38] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/654 places, 527/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2887 ms. Remains : 588/654 places, 527/573 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s135 1) (EQ s172 1)), p1:(OR (EQ s238 0) (EQ s254 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 972 steps with 4 reset in 13 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 3195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||X(X(F(p2)))))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 44 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-16 02:25:39] [INFO ] Computed 137 place invariants in 7 ms
[2023-03-16 02:25:39] [INFO ] Implicit Places using invariants in 671 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 741 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(EQ s351 0), p2:(EQ s419 0), p0:(OR (EQ s43 0) (EQ s167 0))], 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2350 ms.
Product exploration explored 100000 steps with 50000 reset in 2196 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 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-10 finished in 5697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1&&G(p2)))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 651 transition count 570
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 651 transition count 570
Applied a total of 6 rules in 49 ms. Remains 651 /654 variables (removed 3) and now considering 570/573 (removed 3) transitions.
// Phase 1: matrix 570 rows 651 cols
[2023-03-16 02:25:44] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-16 02:25:45] [INFO ] Implicit Places using invariants in 821 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 830 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/573 transitions.
Applied a total of 0 rules in 21 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 902 ms. Remains : 650/654 places, 570/573 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Parking-PT-832-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(EQ s548 1), p2:(EQ s177 0), p1:(EQ s548 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1637 steps with 7 reset in 21 ms.
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-12 finished in 1241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 573/573 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 653 transition count 557
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 638 transition count 557
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 638 transition count 542
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 623 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 619 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 619 transition count 538
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 130 place count 588 transition count 507
Applied a total of 130 rules in 88 ms. Remains 588 /654 variables (removed 66) and now considering 507/573 (removed 66) transitions.
// Phase 1: matrix 507 rows 588 cols
[2023-03-16 02:25:46] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-16 02:25:46] [INFO ] Implicit Places using invariants in 717 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 719 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/654 places, 507/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 506
Applied a total of 2 rules in 43 ms. Remains 586 /587 variables (removed 1) and now considering 506/507 (removed 1) transitions.
// Phase 1: matrix 506 rows 586 cols
[2023-03-16 02:25:46] [INFO ] Computed 136 place invariants in 2 ms
[2023-03-16 02:25:47] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-16 02:25:47] [INFO ] Invariant cache hit.
[2023-03-16 02:25:48] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/654 places, 506/573 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2595 ms. Remains : 586/654 places, 506/573 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s144 1), p1:(AND (EQ s183 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 2830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 569
Applied a total of 8 rules in 42 ms. Remains 650 /654 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 650 cols
[2023-03-16 02:25:49] [INFO ] Computed 137 place invariants in 8 ms
[2023-03-16 02:25:49] [INFO ] Implicit Places using invariants in 814 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 824 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 649/654 places, 569/573 transitions.
Applied a total of 0 rules in 22 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 649/654 places, 569/573 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-832-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s401 1) (EQ s447 1)), p1:(OR (NEQ s16 1) (NEQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-14 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 651 transition count 570
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 651 transition count 570
Applied a total of 6 rules in 45 ms. Remains 651 /654 variables (removed 3) and now considering 570/573 (removed 3) transitions.
// Phase 1: matrix 570 rows 651 cols
[2023-03-16 02:25:50] [INFO ] Computed 137 place invariants in 3 ms
[2023-03-16 02:25:50] [INFO ] Implicit Places using invariants in 805 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 808 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/654 places, 570/573 transitions.
Applied a total of 0 rules in 22 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 650/654 places, 570/573 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s580 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9239 steps with 46 reset in 125 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 1127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-16 02:25:51] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10204240038333459253
[2023-03-16 02:25:51] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2023-03-16 02:25:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:25:51] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2023-03-16 02:25:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:25:51] [INFO ] Applying decomposition
[2023-03-16 02:25:51] [INFO ] Flatten gal took : 48 ms
[2023-03-16 02:25:51] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2023-03-16 02:25:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 02:25:51] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10204240038333459253
Running compilation step : cd /tmp/ltsmin10204240038333459253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1413546492490832990.txt' '-o' '/tmp/graph1413546492490832990.bin' '-w' '/tmp/graph1413546492490832990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1413546492490832990.bin' '-l' '-1' '-v' '-w' '/tmp/graph1413546492490832990.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:25:51] [INFO ] Decomposing Gal with order
[2023-03-16 02:25:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:25:52] [INFO ] Removed a total of 51 redundant transitions.
[2023-03-16 02:25:52] [INFO ] Flatten gal took : 139 ms
[2023-03-16 02:25:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2023-03-16 02:25:52] [INFO ] Time to serialize gal into /tmp/LTLFireability18203620694943224023.gal : 35 ms
[2023-03-16 02:25:52] [INFO ] Time to serialize properties into /tmp/LTLFireability1236089861402808288.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18203620694943224023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1236089861402808288.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((i10.u150.p429!=1)||(i10.u170.p493!=1))"))))
Formula 0 simplified : GF!"((i10.u150.p429!=1)||(i10.u170.p493!=1))"
Compilation finished in 2511 ms.
Running link step : cd /tmp/ltsmin10204240038333459253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10204240038333459253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i5.t571, i5.t556, i5.t555, i5.t549, i5.u79.t130, i5.u79.t131, i6.i1.i2.u103.t112, i8.t508, i8...434
Computing Next relation with stutter on 7.8311e+10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
42274 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,422.947,2301516,1,0,3.42654e+06,3535,2931,2.0247e+07,237,12194,862813
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1242013 ms.

BK_STOP 1678934545240

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-832"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Parking-PT-832, 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 r261-smll-167863536400444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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