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.r263-smll-167863538300452.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 lolaxred
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538300452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:30 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.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 26 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:07 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 427K 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-864-LTLFireability-00
FORMULA_NAME Parking-PT-864-LTLFireability-01
FORMULA_NAME Parking-PT-864-LTLFireability-02
FORMULA_NAME Parking-PT-864-LTLFireability-03
FORMULA_NAME Parking-PT-864-LTLFireability-04
FORMULA_NAME Parking-PT-864-LTLFireability-05
FORMULA_NAME Parking-PT-864-LTLFireability-06
FORMULA_NAME Parking-PT-864-LTLFireability-07
FORMULA_NAME Parking-PT-864-LTLFireability-08
FORMULA_NAME Parking-PT-864-LTLFireability-09
FORMULA_NAME Parking-PT-864-LTLFireability-10
FORMULA_NAME Parking-PT-864-LTLFireability-11
FORMULA_NAME Parking-PT-864-LTLFireability-12
FORMULA_NAME Parking-PT-864-LTLFireability-13
FORMULA_NAME Parking-PT-864-LTLFireability-14
FORMULA_NAME Parking-PT-864-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678795522818

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 12:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:05:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:05:26] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2023-03-14 12:05:26] [INFO ] Transformed 1185 places.
[2023-03-14 12:05:27] [INFO ] Transformed 1697 transitions.
[2023-03-14 12:05:27] [INFO ] Found NUPN structural information;
[2023-03-14 12:05:27] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 464 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2023-03-14 12:05:27] [INFO ] Computed 280 place invariants in 82 ms
[2023-03-14 12:05:29] [INFO ] Implicit Places using invariants in 1708 ms returned []
[2023-03-14 12:05:29] [INFO ] Invariant cache hit.
[2023-03-14 12:05:30] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:05:33] [INFO ] Implicit Places using invariants and state equation in 4403 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 692, 700, 708, 716, 732, 740, 772, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1172, 1174]
Discarding 77 places :
Implicit Place search using SMT with State Equation took 6191 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1185 places, 1002/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1040 transition count 941
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1040 transition count 941
Applied a total of 122 rules in 168 ms. Remains 1040 /1101 variables (removed 61) and now considering 941/1002 (removed 61) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2023-03-14 12:05:34] [INFO ] Computed 203 place invariants in 18 ms
[2023-03-14 12:05:35] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-14 12:05:35] [INFO ] Invariant cache hit.
[2023-03-14 12:05:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:05:37] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1040/1185 places, 941/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10595 ms. Remains : 1040/1185 places, 941/1009 transitions.
Support contains 42 out of 1040 places after structural reductions.
[2023-03-14 12:05:38] [INFO ] Flatten gal took : 231 ms
[2023-03-14 12:05:38] [INFO ] Flatten gal took : 86 ms
[2023-03-14 12:05:38] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 38 out of 1040 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 1085 ms. (steps per millisecond=9 ) properties (out of 26) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-14 12:05:40] [INFO ] Invariant cache hit.
[2023-03-14 12:05:41] [INFO ] [Real]Absence check using 203 positive place invariants in 82 ms returned sat
[2023-03-14 12:05:41] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-14 12:05:41] [INFO ] [Nat]Absence check using 203 positive place invariants in 83 ms returned sat
[2023-03-14 12:05:43] [INFO ] After 1413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-14 12:05:43] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:05:45] [INFO ] After 1580ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-14 12:05:45] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 8 ms to minimize.
[2023-03-14 12:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-14 12:05:45] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2023-03-14 12:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-14 12:05:46] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2023-03-14 12:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-14 12:05:47] [INFO ] After 3983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-14 12:05:48] [INFO ] After 7353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 9 properties in 539 ms.
Support contains 5 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 910
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1009 transition count 879
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 978 transition count 879
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 976 transition count 877
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 976 transition count 877
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 222 place count 929 transition count 830
Free-agglomeration rule applied 253 times.
Iterating global reduction 2 with 253 rules applied. Total rules applied 475 place count 929 transition count 577
Reduce places removed 253 places and 0 transitions.
Graph (complete) has 1349 edges and 676 vertex of which 183 are kept as prefixes of interest. Removing 493 places using SCC suffix rule.3 ms
Discarding 493 places :
Also discarding 407 output transitions
Drop transitions removed 407 transitions
Iterating post reduction 2 with 254 rules applied. Total rules applied 729 place count 183 transition count 170
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 753 place count 183 transition count 146
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 754 place count 183 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 755 place count 183 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 756 place count 182 transition count 144
Applied a total of 756 rules in 430 ms. Remains 182 /1040 variables (removed 858) and now considering 144/941 (removed 797) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 182/1040 places, 144/941 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Finished Best-First random walk after 175 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1||G(p2))))&&p0)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 263 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:05:50] [INFO ] Computed 203 place invariants in 10 ms
[2023-03-14 12:05:51] [INFO ] Implicit Places using invariants in 1073 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 82 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-14 12:05:51] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-14 12:05:52] [INFO ] Implicit Places using invariants in 833 ms returned []
[2023-03-14 12:05:52] [INFO ] Invariant cache hit.
[2023-03-14 12:05:53] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:05:55] [INFO ] Implicit Places using invariants and state equation in 3267 ms returned []
Implicit Place search using SMT with State Equation took 4110 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5540 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s882 1) (EQ s917 1)), p2:(EQ s44 0), p1:(EQ s136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 6173 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(X(G(p0)))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 104 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:05:56] [INFO ] Computed 203 place invariants in 9 ms
[2023-03-14 12:05:57] [INFO ] Implicit Places using invariants in 1087 ms returned [689]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1092 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 939/941 transitions.
Applied a total of 0 rules in 45 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1243 ms. Remains : 1037/1040 places, 939/941 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-02 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s419 1) (EQ s456 1) (OR (NEQ s645 1) (NEQ s688 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 1509 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(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
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 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 226 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-14 12:05:57] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-14 12:05:59] [INFO ] Implicit Places using invariants in 1160 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 128 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-14 12:05:59] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-14 12:06:00] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-14 12:06:00] [INFO ] Invariant cache hit.
[2023-03-14 12:06:02] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2906 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4425 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s358 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 16 ms.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-03 finished in 4504 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(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
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 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 180 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-14 12:06:02] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-14 12:06:03] [INFO ] Implicit Places using invariants in 1262 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 93 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-14 12:06:03] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-14 12:06:04] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2023-03-14 12:06:04] [INFO ] Invariant cache hit.
[2023-03-14 12:06:06] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4295 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 10 ms.
FORMULA Parking-PT-864-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-04 finished in 4365 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(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
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 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 120 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-14 12:06:06] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-14 12:06:07] [INFO ] Implicit Places using invariants in 981 ms returned [378, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 982 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 72 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-14 12:06:07] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:06:08] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-14 12:06:08] [INFO ] Invariant cache hit.
[2023-03-14 12:06:09] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3299 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s481 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 7 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 3368 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))))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 85 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:06:10] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-14 12:06:11] [INFO ] Implicit Places using invariants in 1198 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1201 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 84 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-14 12:06:11] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-14 12:06:12] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2023-03-14 12:06:12] [INFO ] Invariant cache hit.
[2023-03-14 12:06:13] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:06:15] [INFO ] Implicit Places using invariants and state equation in 3080 ms returned []
Implicit Place search using SMT with State Equation took 4127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5498 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-07 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s366 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-07 finished in 5644 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)||F(G(p1))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 974 transition count 875
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 974 transition count 875
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 927 transition count 828
Applied a total of 226 rules in 109 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-14 12:06:15] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-14 12:06:16] [INFO ] Implicit Places using invariants in 1078 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
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 4 place count 922 transition count 826
Applied a total of 4 rules in 118 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-14 12:06:16] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:06:18] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2023-03-14 12:06:18] [INFO ] Invariant cache hit.
[2023-03-14 12:06:18] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-14 12:06:21] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 4799 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6106 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s214 1), p1:(NEQ s745 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 392 reset in 1475 ms.
Product exploration explored 100000 steps with 393 reset in 1356 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 p0) p1), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 302 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Support contains 1 out of 922 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 51 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2023-03-14 12:06:25] [INFO ] Invariant cache hit.
[2023-03-14 12:06:26] [INFO ] Implicit Places using invariants in 1059 ms returned []
[2023-03-14 12:06:26] [INFO ] Invariant cache hit.
[2023-03-14 12:06:27] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-14 12:06:30] [INFO ] Implicit Places using invariants and state equation in 3760 ms returned []
Implicit Place search using SMT with State Equation took 4821 ms to find 0 implicit places.
[2023-03-14 12:06:30] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-14 12:06:30] [INFO ] Invariant cache hit.
[2023-03-14 12:06:31] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6048 ms. Remains : 922/922 places, 826/826 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 169 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 49 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 191 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 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 394 reset in 1494 ms.
Product exploration explored 100000 steps with 394 reset in 1251 ms.
Support contains 1 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 826/826 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 921 transition count 825
Applied a total of 2 rules in 49 ms. Remains 921 /922 variables (removed 1) and now considering 825/826 (removed 1) transitions.
// Phase 1: matrix 825 rows 921 cols
[2023-03-14 12:06:34] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-14 12:06:35] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2023-03-14 12:06:35] [INFO ] Invariant cache hit.
[2023-03-14 12:06:36] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-14 12:06:39] [INFO ] Implicit Places using invariants and state equation in 3218 ms returned []
Implicit Place search using SMT with State Equation took 4398 ms to find 0 implicit places.
[2023-03-14 12:06:39] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-14 12:06:39] [INFO ] Invariant cache hit.
[2023-03-14 12:06:40] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/922 places, 825/826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5388 ms. Remains : 921/922 places, 825/826 transitions.
Treatment of property Parking-PT-864-LTLFireability-08 finished in 24712 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((F(p1)&&p0))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 85 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:06:40] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-14 12:06:41] [INFO ] Implicit Places using invariants in 822 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 826 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 84 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-14 12:06:41] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:06:42] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-14 12:06:42] [INFO ] Invariant cache hit.
[2023-03-14 12:06:43] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:06:45] [INFO ] Implicit Places using invariants and state equation in 3159 ms returned []
Implicit Place search using SMT with State Equation took 4209 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5205 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s650 0) (EQ s414 0)), p1:(EQ s463 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64607 steps with 567 reset in 1195 ms.
FORMULA Parking-PT-864-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-09 finished in 6616 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(F(p1))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 83 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:06:47] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-14 12:06:48] [INFO ] Implicit Places using invariants in 1095 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 85 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-14 12:06:48] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:06:49] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2023-03-14 12:06:49] [INFO ] Invariant cache hit.
[2023-03-14 12:06:49] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:06:52] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 3840 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5107 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s824 0) (EQ s867 0)), p0:(EQ s275 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4084 ms.
Product exploration explored 100000 steps with 50000 reset in 4052 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-10 finished in 13507 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((X((p1 U (p2||G(p1))))||p0))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 49 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2023-03-14 12:07:00] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-14 12:07:01] [INFO ] Implicit Places using invariants in 1002 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1004 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 938
Applied a total of 4 rules in 56 ms. Remains 1034 /1036 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2023-03-14 12:07:01] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-14 12:07:02] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-14 12:07:02] [INFO ] Invariant cache hit.
[2023-03-14 12:07:03] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:05] [INFO ] Implicit Places using invariants and state equation in 3336 ms returned []
Implicit Place search using SMT with State Equation took 4351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1034/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5461 ms. Remains : 1034/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NOT (OR (NEQ s916 1) (AND (EQ s640 1) (EQ s686 1)))) (NEQ s397 1)), p1:(NEQ s397 1), p0:(OR (EQ s640 0) (EQ s686 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 391 reset in 1461 ms.
Entered a terminal (fully accepting) state of product in 43417 steps with 168 reset in 546 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 7681 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 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 48 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:07:08] [INFO ] Computed 203 place invariants in 2 ms
[2023-03-14 12:07:09] [INFO ] Implicit Places using invariants in 842 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 843 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 47 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-14 12:07:09] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:07:10] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-14 12:07:10] [INFO ] Invariant cache hit.
[2023-03-14 12:07:10] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:12] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 3729 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4668 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-12 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:(EQ s269 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 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-12 finished in 4761 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(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 49 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-14 12:07:12] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-14 12:07:13] [INFO ] Implicit Places using invariants in 833 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 835 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 49 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-14 12:07:13] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:07:14] [INFO ] Implicit Places using invariants in 812 ms returned []
[2023-03-14 12:07:14] [INFO ] Invariant cache hit.
[2023-03-14 12:07:15] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:17] [INFO ] Implicit Places using invariants and state equation in 3148 ms returned []
Implicit Place search using SMT with State Equation took 3967 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4902 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s881 1), p0:(EQ s378 0), p2:(NEQ s251 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1317 reset in 1711 ms.
Product exploration explored 100000 steps with 1407 reset in 1651 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 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 12:07:22] [INFO ] Invariant cache hit.
[2023-03-14 12:07:23] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 12:07:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2023-03-14 12:07:24] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 12:07:24] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:24] [INFO ] After 198ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 12:07:24] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-14 12:07:25] [INFO ] After 1978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 206 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 473 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 41 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-14 12:07:26] [INFO ] Invariant cache hit.
[2023-03-14 12:07:27] [INFO ] Implicit Places using invariants in 1455 ms returned []
[2023-03-14 12:07:27] [INFO ] Invariant cache hit.
[2023-03-14 12:07:28] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:30] [INFO ] Implicit Places using invariants and state equation in 3144 ms returned []
Implicit Place search using SMT with State Equation took 4604 ms to find 0 implicit places.
[2023-03-14 12:07:30] [INFO ] Invariant cache hit.
[2023-03-14 12:07:31] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5668 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 12:07:33] [INFO ] Invariant cache hit.
[2023-03-14 12:07:33] [INFO ] [Real]Absence check using 200 positive place invariants in 84 ms returned sat
[2023-03-14 12:07:33] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 12:07:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 97 ms returned sat
[2023-03-14 12:07:35] [INFO ] After 989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 12:07:35] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:35] [INFO ] After 540ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 12:07:36] [INFO ] After 950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-14 12:07:36] [INFO ] After 2725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 203 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=20 )
Parikh walk visited 3 properties in 10 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 542 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1289 reset in 2192 ms.
Product exploration explored 100000 steps with 1297 reset in 1654 ms.
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 38 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-14 12:07:42] [INFO ] Invariant cache hit.
[2023-03-14 12:07:43] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2023-03-14 12:07:43] [INFO ] Invariant cache hit.
[2023-03-14 12:07:44] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-14 12:07:46] [INFO ] Implicit Places using invariants and state equation in 2792 ms returned []
Implicit Place search using SMT with State Equation took 3946 ms to find 0 implicit places.
[2023-03-14 12:07:46] [INFO ] Invariant cache hit.
[2023-03-14 12:07:47] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4905 ms. Remains : 1033/1033 places, 937/937 transitions.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 34505 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) U p1))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 226 place count 927 transition count 828
Applied a total of 226 rules in 182 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-14 12:07:47] [INFO ] Computed 203 place invariants in 7 ms
[2023-03-14 12:07:49] [INFO ] Implicit Places using invariants in 1451 ms returned [379, 580]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1455 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 924 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 924 transition count 827
Applied a total of 2 rules in 62 ms. Remains 924 /925 variables (removed 1) and now considering 827/828 (removed 1) transitions.
// Phase 1: matrix 827 rows 924 cols
[2023-03-14 12:07:49] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-14 12:07:50] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2023-03-14 12:07:50] [INFO ] Invariant cache hit.
[2023-03-14 12:07:51] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-14 12:07:54] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 4893 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 924/1040 places, 827/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6593 ms. Remains : 924/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s648 1) (EQ s702 1)), p0:(AND (EQ s582 1) (EQ s618 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 393 reset in 1279 ms.
Product exploration explored 100000 steps with 393 reset in 1257 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) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 302 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 186158 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186158 steps, saw 86906 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 12:08:00] [INFO ] Invariant cache hit.
[2023-03-14 12:08:00] [INFO ] [Real]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-14 12:08:00] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 12:08:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 87 ms returned sat
[2023-03-14 12:08:02] [INFO ] After 902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 12:08:02] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-14 12:08:02] [INFO ] After 381ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 12:08:03] [INFO ] After 852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 396 ms.
[2023-03-14 12:08:03] [INFO ] After 2607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 924/924 places, 827/827 transitions.
Free-agglomeration rule applied 254 times.
Iterating global reduction 0 with 254 rules applied. Total rules applied 254 place count 924 transition count 573
Reduce places removed 254 places and 0 transitions.
Graph (complete) has 1336 edges and 670 vertex of which 190 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.1 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 0 with 255 rules applied. Total rules applied 509 place count 190 transition count 177
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 533 place count 190 transition count 153
Applied a total of 533 rules in 101 ms. Remains 190 /924 variables (removed 734) and now considering 153/827 (removed 674) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 190/924 places, 153/827 transitions.
Finished random walk after 73 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=73 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 587 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, p0]
[2023-03-14 12:08:04] [INFO ] Invariant cache hit.
[2023-03-14 12:08:05] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 262 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-15 finished in 18498 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)||F(G(p1))))'
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((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-14
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1009 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 975 transition count 876
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 224 place count 928 transition count 829
Applied a total of 224 rules in 178 ms. Remains 928 /1040 variables (removed 112) and now considering 829/941 (removed 112) transitions.
// Phase 1: matrix 829 rows 928 cols
[2023-03-14 12:08:06] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-14 12:08:07] [INFO ] Implicit Places using invariants in 1011 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1013 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 925/1040 places, 829/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 924 transition count 828
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 924 transition count 828
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 4 place count 923 transition count 827
Applied a total of 4 rules in 75 ms. Remains 923 /925 variables (removed 2) and now considering 827/829 (removed 2) transitions.
// Phase 1: matrix 827 rows 923 cols
[2023-03-14 12:08:07] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 12:08:08] [INFO ] Implicit Places using invariants in 981 ms returned []
[2023-03-14 12:08:08] [INFO ] Invariant cache hit.
[2023-03-14 12:08:09] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-14 12:08:12] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 923/1040 places, 827/941 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6044 ms. Remains : 923/1040 places, 827/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s786 1), p0:(EQ s349 0), p2:(NEQ s237 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1313 reset in 1832 ms.
Product exploration explored 100000 steps with 1317 reset in 1659 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 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 12:08:17] [INFO ] Invariant cache hit.
[2023-03-14 12:08:17] [INFO ] [Real]Absence check using 200 positive place invariants in 54 ms returned sat
[2023-03-14 12:08:17] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 12:08:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 57 ms returned sat
[2023-03-14 12:08:18] [INFO ] After 922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 12:08:18] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-14 12:08:19] [INFO ] After 731ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 12:08:20] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-14 12:08:20] [INFO ] After 2653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 204 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 9 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 568 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 31 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2023-03-14 12:08:21] [INFO ] Invariant cache hit.
[2023-03-14 12:08:22] [INFO ] Implicit Places using invariants in 964 ms returned []
[2023-03-14 12:08:22] [INFO ] Invariant cache hit.
[2023-03-14 12:08:23] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-14 12:08:26] [INFO ] Implicit Places using invariants and state equation in 3764 ms returned []
Implicit Place search using SMT with State Equation took 4731 ms to find 0 implicit places.
[2023-03-14 12:08:26] [INFO ] Invariant cache hit.
[2023-03-14 12:08:27] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5733 ms. Remains : 923/923 places, 827/827 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 12:08:29] [INFO ] Invariant cache hit.
[2023-03-14 12:08:29] [INFO ] [Real]Absence check using 200 positive place invariants in 54 ms returned sat
[2023-03-14 12:08:29] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 12:08:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2023-03-14 12:08:30] [INFO ] After 933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 12:08:30] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-14 12:08:31] [INFO ] After 723ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 12:08:31] [INFO ] After 1111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-14 12:08:31] [INFO ] After 2678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 205 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 14 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 529 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1366 reset in 1851 ms.
Product exploration explored 100000 steps with 1338 reset in 1704 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 32 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2023-03-14 12:08:37] [INFO ] Invariant cache hit.
[2023-03-14 12:08:38] [INFO ] Implicit Places using invariants in 1202 ms returned []
[2023-03-14 12:08:38] [INFO ] Invariant cache hit.
[2023-03-14 12:08:39] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-14 12:08:42] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned []
Implicit Place search using SMT with State Equation took 5138 ms to find 0 implicit places.
[2023-03-14 12:08:42] [INFO ] Invariant cache hit.
[2023-03-14 12:08:43] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6272 ms. Remains : 923/923 places, 827/827 transitions.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 37822 ms.
[2023-03-14 12:08:43] [INFO ] Flatten gal took : 97 ms
[2023-03-14 12:08:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 12:08:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1040 places, 941 transitions and 3155 arcs took 16 ms.
Total runtime 197487 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Parking-PT-864
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678795785695

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Parking-PT-864-LTLFireability-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Parking-PT-864-LTLFireability-08
lola: result : false
lola: markings : 934
lola: fired transitions : 1706
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Parking-PT-864-LTLFireability-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3600 4/32 Parking-PT-864-LTLFireability-14 176616 m, 35323 m/sec, 748917 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3600 6/32 Parking-PT-864-LTLFireability-14 345621 m, 33801 m/sec, 1551699 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3600 9/32 Parking-PT-864-LTLFireability-14 512761 m, 33428 m/sec, 2413395 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3600 12/32 Parking-PT-864-LTLFireability-14 689888 m, 35425 m/sec, 3271454 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3600 15/32 Parking-PT-864-LTLFireability-14 854099 m, 32842 m/sec, 4132696 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3600 18/32 Parking-PT-864-LTLFireability-14 1010571 m, 31294 m/sec, 4995116 t fired, .

Time elapsed: 30 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3600 21/32 Parking-PT-864-LTLFireability-14 1178555 m, 33596 m/sec, 5848755 t fired, .

Time elapsed: 35 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3600 24/32 Parking-PT-864-LTLFireability-14 1344283 m, 33145 m/sec, 6702870 t fired, .

Time elapsed: 40 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3600 26/32 Parking-PT-864-LTLFireability-14 1503747 m, 31892 m/sec, 7565705 t fired, .

Time elapsed: 45 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3600 29/32 Parking-PT-864-LTLFireability-14 1661529 m, 31556 m/sec, 8428480 t fired, .

Time elapsed: 50 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3600 32/32 Parking-PT-864-LTLFireability-14 1815031 m, 30700 m/sec, 9292569 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Parking-PT-864-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Parking-PT-864-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-864-LTLFireability-08: LTL false LTL model checker
Parking-PT-864-LTLFireability-14: LTL unknown AGGR


Time elapsed: 60 secs. Pages in use: 32

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-864"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Parking-PT-864, 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 r263-smll-167863538300452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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