Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 107K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716841511449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 20:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 20:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:25:14] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-27 20:25:14] [INFO ] Transformed 305 places.
[2024-05-27 20:25:14] [INFO ] Transformed 433 transitions.
[2024-05-27 20:25:14] [INFO ] Found NUPN structural information;
[2024-05-27 20:25:14] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Applied a total of 4 rules in 69 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2024-05-27 20:25:14] [INFO ] Computed 76 invariants in 20 ms
[2024-05-27 20:25:15] [INFO ] Implicit Places using invariants in 533 ms returned [48, 56, 64, 118, 126, 134, 142, 160, 195, 203, 211, 227, 229, 256, 264, 272, 280, 296, 298]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 580 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 284/305 places, 255/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 273 transition count 244
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 273 transition count 244
Applied a total of 22 rules in 17 ms. Remains 273 /284 variables (removed 11) and now considering 244/255 (removed 11) transitions.
// Phase 1: matrix 244 rows 273 cols
[2024-05-27 20:25:15] [INFO ] Computed 57 invariants in 3 ms
[2024-05-27 20:25:15] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-27 20:25:15] [INFO ] Invariant cache hit.
[2024-05-27 20:25:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:25:15] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 273/305 places, 244/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1321 ms. Remains : 273/305 places, 244/257 transitions.
Support contains 30 out of 273 places after structural reductions.
[2024-05-27 20:25:15] [INFO ] Flatten gal took : 70 ms
[2024-05-27 20:25:16] [INFO ] Flatten gal took : 30 ms
[2024-05-27 20:25:16] [INFO ] Input system was already deterministic with 244 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:25:16] [INFO ] Invariant cache hit.
[2024-05-27 20:25:16] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-05-27 20:25:16] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:25:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2024-05-27 20:25:17] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 20:25:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:25:17] [INFO ] After 94ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 20:25:17] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-27 20:25:17] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 44 ms.
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 244/244 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 273 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 265 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 265 transition count 228
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 257 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 255 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 255 transition count 226
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 239 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 238 transition count 229
Free-agglomeration rule applied 54 times.
Iterating global reduction 2 with 54 rules applied. Total rules applied 124 place count 238 transition count 175
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 178 place count 184 transition count 175
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 184 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 183 transition count 174
Applied a total of 180 rules in 95 ms. Remains 183 /273 variables (removed 90) and now considering 174/244 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 183/273 places, 174/244 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 183 cols
[2024-05-27 20:25:17] [INFO ] Computed 57 invariants in 2 ms
[2024-05-27 20:25:18] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:25:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-27 20:25:18] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:25:18] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 20:25:18] [INFO ] After 72ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:25:18] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-27 20:25:18] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 5 ms.
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 174/174 transitions.
Graph (complete) has 407 edges and 183 vertex of which 144 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.2 ms
Discarding 39 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 144 transition count 139
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 1 with 2 rules applied. Total rules applied 9 place count 143 transition count 138
Applied a total of 9 rules in 16 ms. Remains 143 /183 variables (removed 40) and now considering 138/174 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/183 places, 138/174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 127770 steps, run visited all 1 properties in 544 ms. (steps per millisecond=234 )
Probabilistic random walk after 127770 steps, saw 40231 distinct states, run finished after 545 ms. (steps per millisecond=234 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 270 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 270 transition count 241
Applied a total of 6 rules in 7 ms. Remains 270 /273 variables (removed 3) and now considering 241/244 (removed 3) transitions.
// Phase 1: matrix 241 rows 270 cols
[2024-05-27 20:25:19] [INFO ] Computed 57 invariants in 3 ms
[2024-05-27 20:25:19] [INFO ] Implicit Places using invariants in 191 ms returned [67, 85, 145, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 192 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/273 places, 241/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 238
Applied a total of 6 rules in 6 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-05-27 20:25:19] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:25:19] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-27 20:25:19] [INFO ] Invariant cache hit.
[2024-05-27 20:25:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:25:20] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/273 places, 238/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 760 ms. Remains : 263/273 places, 238/244 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 369 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-00 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:(AND (EQ s91 0) (EQ s81 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Parking-PT-416-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-00 finished in 1198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 271 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 271 transition count 242
Applied a total of 4 rules in 7 ms. Remains 271 /273 variables (removed 2) and now considering 242/244 (removed 2) transitions.
// Phase 1: matrix 242 rows 271 cols
[2024-05-27 20:25:20] [INFO ] Computed 57 invariants in 2 ms
[2024-05-27 20:25:20] [INFO ] Implicit Places using invariants in 199 ms returned [67, 83, 85, 174]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 201 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 267/273 places, 242/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 239
Applied a total of 6 rules in 9 ms. Remains 264 /267 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 264 cols
[2024-05-27 20:25:20] [INFO ] Computed 53 invariants in 1 ms
[2024-05-27 20:25:20] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-27 20:25:20] [INFO ] Invariant cache hit.
[2024-05-27 20:25:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:25:21] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/273 places, 239/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 794 ms. Remains : 264/273 places, 239/244 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s262 0) (EQ s81 1)), p0:(OR (EQ s141 0) (EQ s259 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-02 finished in 960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 253 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 253 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 236 transition count 207
Applied a total of 72 rules in 38 ms. Remains 236 /273 variables (removed 37) and now considering 207/244 (removed 37) transitions.
// Phase 1: matrix 207 rows 236 cols
[2024-05-27 20:25:21] [INFO ] Computed 57 invariants in 1 ms
[2024-05-27 20:25:21] [INFO ] Implicit Places using invariants in 160 ms returned [60, 76, 78, 129, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 163 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/273 places, 207/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 205
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 6 place count 228 transition count 204
Applied a total of 6 rules in 21 ms. Remains 228 /231 variables (removed 3) and now considering 204/207 (removed 3) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-05-27 20:25:21] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:25:21] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-27 20:25:21] [INFO ] Invariant cache hit.
[2024-05-27 20:25:22] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/273 places, 204/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 621 ms. Remains : 228/273 places, 204/244 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s161 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1327 reset in 670 ms.
Product exploration explored 100000 steps with 1326 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 886959 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{}
Probabilistic random walk after 886959 steps, saw 115833 distinct states, run finished after 3002 ms. (steps per millisecond=295 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:25:26] [INFO ] Invariant cache hit.
[2024-05-27 20:25:26] [INFO ] [Real]Absence check using 52 positive place invariants in 13 ms returned sat
[2024-05-27 20:25:26] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:25:26] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2024-05-27 20:25:26] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:25:26] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-27 20:25:26] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 20:25:27] [INFO ] Invariant cache hit.
[2024-05-27 20:25:27] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-27 20:25:27] [INFO ] Invariant cache hit.
[2024-05-27 20:25:27] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-05-27 20:25:27] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-27 20:25:27] [INFO ] Invariant cache hit.
[2024-05-27 20:25:27] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 671 ms. Remains : 228/228 places, 204/204 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 964273 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 964273 steps, saw 123361 distinct states, run finished after 3002 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:25:30] [INFO ] Invariant cache hit.
[2024-05-27 20:25:30] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2024-05-27 20:25:31] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:25:31] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2024-05-27 20:25:31] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:25:31] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-27 20:25:31] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1325 reset in 320 ms.
Product exploration explored 100000 steps with 1324 reset in 361 ms.
Built C files in :
/tmp/ltsmin5031239728756591552
[2024-05-27 20:25:32] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2024-05-27 20:25:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:25:32] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2024-05-27 20:25:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:25:32] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2024-05-27 20:25:32] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:25:32] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5031239728756591552
Running compilation step : cd /tmp/ltsmin5031239728756591552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin5031239728756591552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5031239728756591552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16732840315643623651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 11 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 20:25:47] [INFO ] Invariant cache hit.
[2024-05-27 20:25:47] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-27 20:25:47] [INFO ] Invariant cache hit.
[2024-05-27 20:25:47] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-27 20:25:47] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-27 20:25:47] [INFO ] Invariant cache hit.
[2024-05-27 20:25:48] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 228/228 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin3171888701778487632
[2024-05-27 20:25:48] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2024-05-27 20:25:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:25:48] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2024-05-27 20:25:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:25:48] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2024-05-27 20:25:48] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:25:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3171888701778487632
Running compilation step : cd /tmp/ltsmin3171888701778487632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 590 ms.
Running link step : cd /tmp/ltsmin3171888701778487632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3171888701778487632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10933454037668569352.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:26:03] [INFO ] Flatten gal took : 17 ms
[2024-05-27 20:26:03] [INFO ] Flatten gal took : 16 ms
[2024-05-27 20:26:03] [INFO ] Time to serialize gal into /tmp/LTL16128997087681046136.gal : 5 ms
[2024-05-27 20:26:03] [INFO ] Time to serialize properties into /tmp/LTL9205643375963427777.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16128997087681046136.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3524785187527953663.hoa' '-atoms' '/tmp/LTL9205643375963427777.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9205643375963427777.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3524785187527953663.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:26:18] [INFO ] Flatten gal took : 15 ms
[2024-05-27 20:26:18] [INFO ] Flatten gal took : 15 ms
[2024-05-27 20:26:18] [INFO ] Time to serialize gal into /tmp/LTL18038558743080661013.gal : 4 ms
[2024-05-27 20:26:18] [INFO ] Time to serialize properties into /tmp/LTL16607422986498602946.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18038558743080661013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16607422986498602946.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p215!=1)"))))
Formula 0 simplified : GF!"(p215!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1489 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.9289,387924,1,0,409,1.95742e+06,24,452,5107,2.4671e+06,871
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property Parking-PT-416-LTLCardinality-06 finished in 72012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 270 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 270 transition count 241
Applied a total of 6 rules in 7 ms. Remains 270 /273 variables (removed 3) and now considering 241/244 (removed 3) transitions.
// Phase 1: matrix 241 rows 270 cols
[2024-05-27 20:26:33] [INFO ] Computed 57 invariants in 2 ms
[2024-05-27 20:26:33] [INFO ] Implicit Places using invariants in 207 ms returned [67, 83, 85, 145, 173]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 209 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/273 places, 241/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 261 transition count 237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 261 transition count 237
Applied a total of 8 rules in 8 ms. Remains 261 /265 variables (removed 4) and now considering 237/241 (removed 4) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-27 20:26:33] [INFO ] Computed 52 invariants in 2 ms
[2024-05-27 20:26:33] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-27 20:26:33] [INFO ] Invariant cache hit.
[2024-05-27 20:26:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:26:34] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/273 places, 237/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 811 ms. Remains : 261/273 places, 237/244 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s45 0) (NEQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-07 finished in 907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 271 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 271 transition count 242
Applied a total of 4 rules in 7 ms. Remains 271 /273 variables (removed 2) and now considering 242/244 (removed 2) transitions.
// Phase 1: matrix 242 rows 271 cols
[2024-05-27 20:26:34] [INFO ] Computed 57 invariants in 2 ms
[2024-05-27 20:26:34] [INFO ] Implicit Places using invariants in 188 ms returned [67, 83, 85, 145]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 190 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 267/273 places, 242/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 239
Applied a total of 6 rules in 6 ms. Remains 264 /267 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 264 cols
[2024-05-27 20:26:34] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:26:34] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-27 20:26:34] [INFO ] Invariant cache hit.
[2024-05-27 20:26:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:26:35] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/273 places, 239/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 774 ms. Remains : 264/273 places, 239/244 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s54 0) (EQ s166 1) (EQ s249 0) (EQ s215 1)), p1:(AND (EQ s227 0) (EQ s13 1) (OR (EQ s54 0) (EQ s166 1)))], 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]]
Product exploration explored 100000 steps with 50000 reset in 1023 ms.
Product exploration explored 100000 steps with 50000 reset in 962 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLCardinality-08 finished in 2951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 273 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 265 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 265 transition count 228
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 257 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 254 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 254 transition count 225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 237 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 236 transition count 227
Applied a total of 74 rules in 40 ms. Remains 236 /273 variables (removed 37) and now considering 227/244 (removed 17) transitions.
// Phase 1: matrix 227 rows 236 cols
[2024-05-27 20:26:37] [INFO ] Computed 57 invariants in 2 ms
[2024-05-27 20:26:37] [INFO ] Implicit Places using invariants in 184 ms returned [61, 77, 79, 130, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 186 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/273 places, 227/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 225
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 6 place count 228 transition count 224
Applied a total of 6 rules in 17 ms. Remains 228 /231 variables (removed 3) and now considering 224/227 (removed 3) transitions.
// Phase 1: matrix 224 rows 228 cols
[2024-05-27 20:26:37] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:26:37] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-27 20:26:37] [INFO ] Invariant cache hit.
[2024-05-27 20:26:37] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 20:26:38] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/273 places, 224/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 785 ms. Remains : 228/273 places, 224/244 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s110 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1325 reset in 332 ms.
Product exploration explored 100000 steps with 1333 reset in 381 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 937600 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 937600 steps, saw 119749 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:26:42] [INFO ] Invariant cache hit.
[2024-05-27 20:26:42] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:26:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2024-05-27 20:26:42] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:26:42] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 20:26:42] [INFO ] After 33ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:26:42] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-27 20:26:42] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 224/224 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 228 transition count 162
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 371 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 45 transition count 46
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 135 place count 45 transition count 36
Applied a total of 135 rules in 17 ms. Remains 45 /228 variables (removed 183) and now considering 36/224 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 45/228 places, 36/224 transitions.
Finished random walk after 3465 steps, including 113 resets, run visited all 1 properties in 5 ms. (steps per millisecond=693 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-27 20:26:42] [INFO ] Invariant cache hit.
[2024-05-27 20:26:42] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-27 20:26:42] [INFO ] Invariant cache hit.
[2024-05-27 20:26:42] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 20:26:43] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-27 20:26:43] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:26:43] [INFO ] Invariant cache hit.
[2024-05-27 20:26:43] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 228/228 places, 224/224 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 950971 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 950971 steps, saw 121227 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:26:46] [INFO ] Invariant cache hit.
[2024-05-27 20:26:46] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:26:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2024-05-27 20:26:46] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:26:46] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 20:26:46] [INFO ] After 33ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:26:46] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-27 20:26:47] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 224/224 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 228 transition count 162
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 371 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 45 transition count 46
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 135 place count 45 transition count 36
Applied a total of 135 rules in 15 ms. Remains 45 /228 variables (removed 183) and now considering 36/224 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 45/228 places, 36/224 transitions.
Incomplete random walk after 10000 steps, including 363 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44 steps, run visited all 1 properties in 6 ms. (steps per millisecond=7 )
Probabilistic random walk after 44 steps, saw 32 distinct states, run finished after 7 ms. (steps per millisecond=6 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1333 reset in 331 ms.
Product exploration explored 100000 steps with 1329 reset in 374 ms.
Built C files in :
/tmp/ltsmin18293474193808154207
[2024-05-27 20:26:47] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-27 20:26:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:26:47] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-27 20:26:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:26:48] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-27 20:26:48] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:26:48] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18293474193808154207
Running compilation step : cd /tmp/ltsmin18293474193808154207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 668 ms.
Running link step : cd /tmp/ltsmin18293474193808154207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18293474193808154207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6754999184462693556.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 224/224 transitions.
Applied a total of 0 rules in 12 ms. Remains 228 /228 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-27 20:27:03] [INFO ] Invariant cache hit.
[2024-05-27 20:27:03] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-27 20:27:03] [INFO ] Invariant cache hit.
[2024-05-27 20:27:03] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 20:27:03] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-27 20:27:03] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:27:03] [INFO ] Invariant cache hit.
[2024-05-27 20:27:03] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 741 ms. Remains : 228/228 places, 224/224 transitions.
Built C files in :
/tmp/ltsmin667440964376268513
[2024-05-27 20:27:03] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-27 20:27:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:27:03] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-27 20:27:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:27:03] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-27 20:27:03] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:27:03] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin667440964376268513
Running compilation step : cd /tmp/ltsmin667440964376268513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 670 ms.
Running link step : cd /tmp/ltsmin667440964376268513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin667440964376268513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8131902449986349645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:27:18] [INFO ] Flatten gal took : 21 ms
[2024-05-27 20:27:19] [INFO ] Flatten gal took : 21 ms
[2024-05-27 20:27:19] [INFO ] Time to serialize gal into /tmp/LTL15157159195381477393.gal : 5 ms
[2024-05-27 20:27:19] [INFO ] Time to serialize properties into /tmp/LTL4862846073934044352.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15157159195381477393.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12740016985056332420.hoa' '-atoms' '/tmp/LTL4862846073934044352.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4862846073934044352.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12740016985056332420.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
562 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.65843,171720,1,0,544,798640,24,475,5761,1.04457e+06,921
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-416-LTLCardinality-10 finished in 48463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 254 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 254 transition count 225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 70 place count 237 transition count 208
Applied a total of 70 rules in 25 ms. Remains 237 /273 variables (removed 36) and now considering 208/244 (removed 36) transitions.
// Phase 1: matrix 208 rows 237 cols
[2024-05-27 20:27:25] [INFO ] Computed 57 invariants in 1 ms
[2024-05-27 20:27:26] [INFO ] Implicit Places using invariants in 206 ms returned [60, 76, 129, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 208 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/273 places, 208/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 231 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 231 transition count 206
Applied a total of 4 rules in 11 ms. Remains 231 /233 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 231 cols
[2024-05-27 20:27:26] [INFO ] Computed 53 invariants in 1 ms
[2024-05-27 20:27:26] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-27 20:27:26] [INFO ] Invariant cache hit.
[2024-05-27 20:27:26] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/273 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 715 ms. Remains : 231/273 places, 206/244 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s115 0) (EQ s228 1)), p1:(EQ s74 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 5960 reset in 575 ms.
Product exploration explored 100000 steps with 6119 reset in 584 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:27:28] [INFO ] Invariant cache hit.
[2024-05-27 20:27:28] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:27:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 14 ms returned sat
[2024-05-27 20:27:28] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:27:28] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-27 20:27:28] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-27 20:27:28] [INFO ] Invariant cache hit.
[2024-05-27 20:27:29] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-27 20:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:27:29] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-27 20:27:29] [INFO ] Computed and/alt/rep : 137/198/137 causal constraints (skipped 1 transitions) in 12 ms.
[2024-05-27 20:27:29] [INFO ] Added : 21 causal constraints over 5 iterations in 122 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-27 20:27:29] [INFO ] Invariant cache hit.
[2024-05-27 20:27:29] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-27 20:27:29] [INFO ] Invariant cache hit.
[2024-05-27 20:27:29] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2024-05-27 20:27:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-27 20:27:29] [INFO ] Invariant cache hit.
[2024-05-27 20:27:29] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 231/231 places, 206/206 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:27:30] [INFO ] Invariant cache hit.
[2024-05-27 20:27:30] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:27:30] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-27 20:27:30] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:27:30] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-27 20:27:30] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-27 20:27:31] [INFO ] Invariant cache hit.
[2024-05-27 20:27:31] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2024-05-27 20:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:27:31] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-27 20:27:31] [INFO ] Computed and/alt/rep : 137/198/137 causal constraints (skipped 1 transitions) in 16 ms.
[2024-05-27 20:27:31] [INFO ] Added : 21 causal constraints over 5 iterations in 116 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 6016 reset in 439 ms.
Product exploration explored 100000 steps with 6023 reset in 495 ms.
Built C files in :
/tmp/ltsmin10139976547500519027
[2024-05-27 20:27:32] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2024-05-27 20:27:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:27:32] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2024-05-27 20:27:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:27:32] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2024-05-27 20:27:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:27:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10139976547500519027
Running compilation step : cd /tmp/ltsmin10139976547500519027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin10139976547500519027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10139976547500519027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6890586997632019317.hoa' '--buchi-type=spotba'
LTSmin run took 795 ms.
FORMULA Parking-PT-416-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-416-LTLCardinality-12 finished in 8116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U G(!p1)))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 253 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 253 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 236 transition count 207
Applied a total of 72 rules in 21 ms. Remains 236 /273 variables (removed 37) and now considering 207/244 (removed 37) transitions.
// Phase 1: matrix 207 rows 236 cols
[2024-05-27 20:27:33] [INFO ] Computed 57 invariants in 1 ms
[2024-05-27 20:27:34] [INFO ] Implicit Places using invariants in 183 ms returned [60, 76, 78, 129, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 185 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/273 places, 207/244 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 205
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 6 place count 228 transition count 204
Applied a total of 6 rules in 11 ms. Remains 228 /231 variables (removed 3) and now considering 204/207 (removed 3) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-05-27 20:27:34] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:27:34] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-27 20:27:34] [INFO ] Invariant cache hit.
[2024-05-27 20:27:34] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/273 places, 204/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 686 ms. Remains : 228/273 places, 204/244 transitions.
Stuttering acceptance computed with spot in 75 ms :[p1, p0]
Running random walk in product with property : Parking-PT-416-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s81 0) (EQ s154 1)), p0:(OR (EQ s70 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 150 steps with 1 reset in 0 ms.
FORMULA Parking-PT-416-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLCardinality-13 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (X(p1)&&(G(p0)||p2)))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 270 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 270 transition count 241
Applied a total of 6 rules in 8 ms. Remains 270 /273 variables (removed 3) and now considering 241/244 (removed 3) transitions.
// Phase 1: matrix 241 rows 270 cols
[2024-05-27 20:27:34] [INFO ] Computed 57 invariants in 2 ms
[2024-05-27 20:27:34] [INFO ] Implicit Places using invariants in 184 ms returned [83, 85, 145, 173]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 186 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/273 places, 241/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 238
Applied a total of 6 rules in 7 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-05-27 20:27:34] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:27:35] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-27 20:27:35] [INFO ] Invariant cache hit.
[2024-05-27 20:27:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:27:35] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/273 places, 238/244 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 767 ms. Remains : 263/273 places, 238/244 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s67 0) (EQ s202 1)), p0:(OR (EQ s199 0) (EQ s51 1)), p1:(OR (EQ s107 0) (EQ s250 1))], nbAcceptance=1, 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 5956 reset in 610 ms.
Product exploration explored 100000 steps with 5932 reset in 599 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 p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (OR p2 p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 509 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1563 steps, including 19 resets, run visited all 11 properties in 54 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (OR p2 p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR p2 p0))), (X (X (NOT (OR p2 p0)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 10 factoid took 924 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-27 20:27:39] [INFO ] Invariant cache hit.
[2024-05-27 20:27:39] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-27 20:27:39] [INFO ] Invariant cache hit.
[2024-05-27 20:27:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:27:39] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-27 20:27:40] [INFO ] Invariant cache hit.
[2024-05-27 20:27:40] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 736 ms. Remains : 263/263 places, 238/238 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 p0 p2 p1), (X (AND p0 (NOT p2))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (OR p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 570 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1596 steps, including 20 resets, run visited all 11 properties in 52 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 (NOT p2))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (OR p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 10 factoid took 915 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5935 reset in 550 ms.
Product exploration explored 100000 steps with 6037 reset in 590 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 263 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 263 transition count 238
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 263 transition count 238
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 255 transition count 230
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 255 transition count 230
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 255 transition count 238
Deduced a syphon composed of 24 places in 1 ms
Applied a total of 48 rules in 29 ms. Remains 255 /263 variables (removed 8) and now considering 238/238 (removed 0) transitions.
[2024-05-27 20:27:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 238 rows 255 cols
[2024-05-27 20:27:44] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:27:44] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/263 places, 238/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 255/263 places, 238/238 transitions.
Built C files in :
/tmp/ltsmin4033812652945383
[2024-05-27 20:27:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4033812652945383
Running compilation step : cd /tmp/ltsmin4033812652945383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 603 ms.
Running link step : cd /tmp/ltsmin4033812652945383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4033812652945383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6385014563977665553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 12 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-05-27 20:27:59] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:28:00] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-27 20:28:00] [INFO ] Invariant cache hit.
[2024-05-27 20:28:00] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:28:00] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-27 20:28:00] [INFO ] Invariant cache hit.
[2024-05-27 20:28:00] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 263/263 places, 238/238 transitions.
Built C files in :
/tmp/ltsmin6019367484832968629
[2024-05-27 20:28:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6019367484832968629
Running compilation step : cd /tmp/ltsmin6019367484832968629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 528 ms.
Running link step : cd /tmp/ltsmin6019367484832968629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6019367484832968629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6609245806642932784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:28:15] [INFO ] Flatten gal took : 16 ms
[2024-05-27 20:28:15] [INFO ] Flatten gal took : 15 ms
[2024-05-27 20:28:15] [INFO ] Time to serialize gal into /tmp/LTL18144409782036200964.gal : 2 ms
[2024-05-27 20:28:15] [INFO ] Time to serialize properties into /tmp/LTL2416394875976804987.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18144409782036200964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17892979752686078162.hoa' '-atoms' '/tmp/LTL2416394875976804987.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("((p227==0)||(p53==1))"))U((X("((p116==0)||(p289==1))"))&&(("((p72==0)||(p233==1))")||(G("((p227==0)||(p53==1))")))))))
Formula 0 simplified : X(G!"((p227==0)||(p53==1))" R (X!"((p116==0)||(p289==1))" | (!"((p72==0)||(p233==1))" & F!"((p227==0)||(p53==1))")))
Detected timeout of ITS tools.
[2024-05-27 20:28:46] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:28:46] [INFO ] Applying decomposition
[2024-05-27 20:28:46] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11801365694235350738.txt' '-o' '/tmp/graph11801365694235350738.bin' '-w' '/tmp/graph11801365694235350738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11801365694235350738.bin' '-l' '-1' '-v' '-w' '/tmp/graph11801365694235350738.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:28:46] [INFO ] Decomposing Gal with order
[2024-05-27 20:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:28:46] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-27 20:28:46] [INFO ] Flatten gal took : 75 ms
[2024-05-27 20:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-27 20:28:46] [INFO ] Time to serialize gal into /tmp/LTL6945712087524708249.gal : 10 ms
[2024-05-27 20:28:46] [INFO ] Time to serialize properties into /tmp/LTL10889704166843618175.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6945712087524708249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10889704166843618175.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i8.i1.u62.p227==0)||(i3.u33.p53==1))"))U((X("((i6.u52.p116==0)||(i12.i3.u87.p289==1))"))&&(("((i2.i2.u25.p72==0)||(i9.u71.p...217
Formula 0 simplified : X(G!"((i8.i1.u62.p227==0)||(i3.u33.p53==1))" R (X!"((i6.u52.p116==0)||(i12.i3.u87.p289==1))" | (!"((i2.i2.u25.p72==0)||(i9.u71.p233=...208
Reverse transition relation is NOT exact ! Due to transitions i3.u33.t58, i6.u52.t39, i9.u71.t21, i11.u91.t3, Intersection with reachable at each step ena...209
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
244 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.4954,100200,1,0,184464,2324,3713,321495,463,9949,230918
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-416-LTLCardinality-14 finished in 74717 ms.
All properties solved by simple procedures.
Total runtime 215487 ms.

BK_STOP 1716841730449

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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