fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r265-smll-167863540000435
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
404.304 55110.00 83632.00 922.90 FF?F?TTFF?F?TFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679004176295

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 22:02:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 22:02:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:02:59] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-16 22:02:59] [INFO ] Transformed 529 places.
[2023-03-16 22:02:59] [INFO ] Transformed 785 transitions.
[2023-03-16 22:02:59] [INFO ] Found NUPN structural information;
[2023-03-16 22:02:59] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-432-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 455
Applied a total of 4 rules in 123 ms. Remains 527 /529 variables (removed 2) and now considering 455/457 (removed 2) transitions.
// Phase 1: matrix 455 rows 527 cols
[2023-03-16 22:02:59] [INFO ] Computed 124 place invariants in 36 ms
[2023-03-16 22:03:00] [INFO ] Implicit Places using invariants in 842 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 190, 198, 206, 214, 222, 230, 246, 270, 316, 324, 332, 340, 348, 356, 364, 372, 396, 398, 441, 457, 465, 473, 481, 489, 497, 521, 523]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 888 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 490/529 places, 455/457 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 460 transition count 425
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 460 transition count 425
Applied a total of 60 rules in 54 ms. Remains 460 /490 variables (removed 30) and now considering 425/455 (removed 30) transitions.
// Phase 1: matrix 425 rows 460 cols
[2023-03-16 22:03:00] [INFO ] Computed 87 place invariants in 5 ms
[2023-03-16 22:03:01] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-16 22:03:01] [INFO ] Invariant cache hit.
[2023-03-16 22:03:01] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 22:03:01] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 460/529 places, 425/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2123 ms. Remains : 460/529 places, 425/457 transitions.
Support contains 29 out of 460 places after structural reductions.
[2023-03-16 22:03:02] [INFO ] Flatten gal took : 112 ms
[2023-03-16 22:03:02] [INFO ] Flatten gal took : 45 ms
[2023-03-16 22:03:02] [INFO ] Input system was already deterministic with 425 transitions.
Support contains 27 out of 460 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 22:03:03] [INFO ] Invariant cache hit.
[2023-03-16 22:03:03] [INFO ] [Real]Absence check using 87 positive place invariants in 22 ms returned sat
[2023-03-16 22:03:03] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2023-03-16 22:03:03] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 22:03:03] [INFO ] After 85ms SMT Verify possible using 108 Read/Feed constraints in real domain returned unsat :1 sat :1 real:1
[2023-03-16 22:03:03] [INFO ] After 146ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-16 22:03:03] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-16 22:03:03] [INFO ] [Nat]Absence check using 87 positive place invariants in 26 ms returned sat
[2023-03-16 22:03:04] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-16 22:03:04] [INFO ] After 83ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-16 22:03:04] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-16 22:03:04] [INFO ] After 728ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 15 ms.
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 425/425 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 460 transition count 410
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 445 transition count 410
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 445 transition count 394
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 429 transition count 394
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 427 transition count 392
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 427 transition count 392
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 114 place count 403 transition count 368
Free-agglomeration rule applied 105 times.
Iterating global reduction 2 with 105 rules applied. Total rules applied 219 place count 403 transition count 263
Reduce places removed 105 places and 0 transitions.
Graph (complete) has 605 edges and 298 vertex of which 149 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.2 ms
Discarding 149 places :
Also discarding 127 output transitions
Drop transitions removed 127 transitions
Iterating post reduction 2 with 106 rules applied. Total rules applied 325 place count 149 transition count 136
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 333 place count 149 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 149 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 148 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 336 place count 147 transition count 126
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 120 edges and 103 vertex of which 89 / 103 are part of one of the 2 SCC in 3 ms
Free SCC test removed 87 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 49 rules applied. Total rules applied 385 place count 16 transition count 122
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 108 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 118 rules applied. Total rules applied 503 place count 12 transition count 8
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 8 rules applied. Total rules applied 511 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 513 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 513 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 515 place count 4 transition count 4
Applied a total of 515 rules in 138 ms. Remains 4 /460 variables (removed 456) and now considering 4/425 (removed 421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 4/460 places, 4/425 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA Parking-PT-432-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(p1)&&F(G(p0)))))))'
Support contains 4 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 459 transition count 409
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 444 transition count 409
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 444 transition count 393
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 428 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 426 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 426 transition count 391
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 114 place count 402 transition count 367
Applied a total of 114 rules in 82 ms. Remains 402 /460 variables (removed 58) and now considering 367/425 (removed 58) transitions.
// Phase 1: matrix 367 rows 402 cols
[2023-03-16 22:03:05] [INFO ] Computed 87 place invariants in 4 ms
[2023-03-16 22:03:05] [INFO ] Implicit Places using invariants in 332 ms returned [183, 211, 349]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 344 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/460 places, 367/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 398 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 398 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 397 transition count 365
Applied a total of 4 rules in 60 ms. Remains 397 /399 variables (removed 2) and now considering 365/367 (removed 2) transitions.
// Phase 1: matrix 365 rows 397 cols
[2023-03-16 22:03:05] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:05] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-16 22:03:05] [INFO ] Invariant cache hit.
[2023-03-16 22:03:06] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/460 places, 365/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1247 ms. Remains : 397/460 places, 365/425 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s258 0) (EQ s16 1)), p1:(AND (EQ s60 0) (EQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 7 ms.
FORMULA Parking-PT-432-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-00 finished in 1638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 459 transition count 408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 443 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 443 transition count 392
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 427 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 425 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 425 transition count 390
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 116 place count 401 transition count 366
Applied a total of 116 rules in 62 ms. Remains 401 /460 variables (removed 59) and now considering 366/425 (removed 59) transitions.
// Phase 1: matrix 366 rows 401 cols
[2023-03-16 22:03:06] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-16 22:03:07] [INFO ] Implicit Places using invariants in 440 ms returned [183, 211, 349]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 443 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/460 places, 366/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 396 transition count 364
Applied a total of 4 rules in 34 ms. Remains 396 /398 variables (removed 2) and now considering 364/366 (removed 2) transitions.
// Phase 1: matrix 364 rows 396 cols
[2023-03-16 22:03:07] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:07] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-16 22:03:07] [INFO ] Invariant cache hit.
[2023-03-16 22:03:07] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 396/460 places, 364/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1440 ms. Remains : 396/460 places, 364/425 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s103 0)], 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 931 reset in 787 ms.
Product exploration explored 100000 steps with 929 reset in 671 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 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 41 ms :[(NOT p0)]
Finished random walk after 322 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 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 39 ms :[(NOT p0)]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 14 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-16 22:03:09] [INFO ] Invariant cache hit.
[2023-03-16 22:03:10] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-16 22:03:10] [INFO ] Invariant cache hit.
[2023-03-16 22:03:10] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-16 22:03:10] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-16 22:03:10] [INFO ] Invariant cache hit.
[2023-03-16 22:03:11] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1418 ms. Remains : 396/396 places, 364/364 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 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 342 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=114 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 933 reset in 486 ms.
Product exploration explored 100000 steps with 935 reset in 575 ms.
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 15 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-16 22:03:12] [INFO ] Invariant cache hit.
[2023-03-16 22:03:13] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-16 22:03:13] [INFO ] Invariant cache hit.
[2023-03-16 22:03:13] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-16 22:03:13] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 22:03:13] [INFO ] Invariant cache hit.
[2023-03-16 22:03:14] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1270 ms. Remains : 396/396 places, 364/364 transitions.
Treatment of property Parking-PT-432-LTLCardinality-02 finished in 7804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F((G(F(!p1))||(p1&&F(!p1))))))'
Support contains 3 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 423
Applied a total of 4 rules in 16 ms. Remains 458 /460 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 458 cols
[2023-03-16 22:03:14] [INFO ] Computed 87 place invariants in 3 ms
[2023-03-16 22:03:14] [INFO ] Implicit Places using invariants in 425 ms returned [208, 395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 427 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/460 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 454 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 454 transition count 421
Applied a total of 4 rules in 17 ms. Remains 454 /456 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 454 cols
[2023-03-16 22:03:14] [INFO ] Computed 85 place invariants in 3 ms
[2023-03-16 22:03:15] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-16 22:03:15] [INFO ] Invariant cache hit.
[2023-03-16 22:03:15] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 22:03:16] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 454/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1700 ms. Remains : 454/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s236 0), p1:(OR (EQ s24 0) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-03 finished in 1965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Support contains 4 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 460 transition count 409
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 444 transition count 409
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 444 transition count 393
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 428 transition count 393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 427 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 427 transition count 392
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 114 place count 403 transition count 368
Applied a total of 114 rules in 72 ms. Remains 403 /460 variables (removed 57) and now considering 368/425 (removed 57) transitions.
// Phase 1: matrix 368 rows 403 cols
[2023-03-16 22:03:16] [INFO ] Computed 87 place invariants in 3 ms
[2023-03-16 22:03:16] [INFO ] Implicit Places using invariants in 280 ms returned [212, 351]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 285 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/460 places, 368/425 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 367
Applied a total of 2 rules in 24 ms. Remains 400 /401 variables (removed 1) and now considering 367/368 (removed 1) transitions.
// Phase 1: matrix 367 rows 400 cols
[2023-03-16 22:03:16] [INFO ] Computed 85 place invariants in 2 ms
[2023-03-16 22:03:16] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-16 22:03:16] [INFO ] Invariant cache hit.
[2023-03-16 22:03:17] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 22:03:17] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 400/460 places, 367/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1496 ms. Remains : 400/460 places, 367/425 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s227 0) (EQ s211 1)), p1:(OR (EQ s351 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 923 reset in 590 ms.
Product exploration explored 100000 steps with 932 reset in 651 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8541 steps, including 79 resets, run visited all 2 properties in 155 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 367/367 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2023-03-16 22:03:20] [INFO ] Invariant cache hit.
[2023-03-16 22:03:20] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-16 22:03:20] [INFO ] Invariant cache hit.
[2023-03-16 22:03:20] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 22:03:21] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2023-03-16 22:03:21] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 22:03:21] [INFO ] Invariant cache hit.
[2023-03-16 22:03:21] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1473 ms. Remains : 400/400 places, 367/367 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-16 22:03:22] [INFO ] Invariant cache hit.
[2023-03-16 22:03:22] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:03:22] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2023-03-16 22:03:22] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:03:22] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 22:03:22] [INFO ] After 49ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 22:03:22] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-16 22:03:22] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 367/367 transitions.
Free-agglomeration rule applied 114 times.
Iterating global reduction 0 with 114 rules applied. Total rules applied 114 place count 400 transition count 253
Reduce places removed 114 places and 0 transitions.
Graph (complete) has 594 edges and 286 vertex of which 219 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.0 ms
Discarding 67 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Iterating post reduction 0 with 115 rules applied. Total rules applied 229 place count 219 transition count 197
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 235 place count 219 transition count 191
Applied a total of 235 rules in 31 ms. Remains 219 /400 variables (removed 181) and now considering 191/367 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 219/400 places, 191/367 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 922 reset in 527 ms.
Product exploration explored 100000 steps with 920 reset in 596 ms.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 367/367 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2023-03-16 22:03:24] [INFO ] Invariant cache hit.
[2023-03-16 22:03:24] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-16 22:03:24] [INFO ] Invariant cache hit.
[2023-03-16 22:03:24] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-16 22:03:25] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2023-03-16 22:03:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 22:03:25] [INFO ] Invariant cache hit.
[2023-03-16 22:03:25] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1519 ms. Remains : 400/400 places, 367/367 transitions.
Treatment of property Parking-PT-432-LTLCardinality-04 finished in 9585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 423
Applied a total of 4 rules in 16 ms. Remains 458 /460 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 458 cols
[2023-03-16 22:03:25] [INFO ] Computed 87 place invariants in 3 ms
[2023-03-16 22:03:26] [INFO ] Implicit Places using invariants in 353 ms returned [208, 238, 395]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 357 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/460 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 16 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2023-03-16 22:03:26] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:26] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-16 22:03:26] [INFO ] Invariant cache hit.
[2023-03-16 22:03:26] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 22:03:27] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/460 places, 421/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1516 ms. Remains : 453/460 places, 421/425 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s318 0) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 409 steps with 3 reset in 2 ms.
FORMULA Parking-PT-432-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-07 finished in 1700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 459 transition count 408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 443 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 443 transition count 392
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 427 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 425 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 425 transition count 390
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 116 place count 401 transition count 366
Applied a total of 116 rules in 40 ms. Remains 401 /460 variables (removed 59) and now considering 366/425 (removed 59) transitions.
// Phase 1: matrix 366 rows 401 cols
[2023-03-16 22:03:27] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-16 22:03:27] [INFO ] Implicit Places using invariants in 336 ms returned [183, 211, 349]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 338 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/460 places, 366/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 396 transition count 364
Applied a total of 4 rules in 28 ms. Remains 396 /398 variables (removed 2) and now considering 364/366 (removed 2) transitions.
// Phase 1: matrix 364 rows 396 cols
[2023-03-16 22:03:27] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:28] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-16 22:03:28] [INFO ] Invariant cache hit.
[2023-03-16 22:03:28] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 396/460 places, 364/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1281 ms. Remains : 396/460 places, 364/425 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s297 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 958 reset in 508 ms.
Product exploration explored 100000 steps with 957 reset in 580 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 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 11 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-16 22:03:30] [INFO ] Invariant cache hit.
[2023-03-16 22:03:30] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-16 22:03:30] [INFO ] Invariant cache hit.
[2023-03-16 22:03:31] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-16 22:03:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 22:03:31] [INFO ] Invariant cache hit.
[2023-03-16 22:03:31] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1233 ms. Remains : 396/396 places, 364/364 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 944 steps, including 8 resets, run visited all 1 properties in 5 ms. (steps per millisecond=188 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 955 reset in 499 ms.
Product exploration explored 100000 steps with 964 reset in 584 ms.
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 11 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-16 22:03:33] [INFO ] Invariant cache hit.
[2023-03-16 22:03:33] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-16 22:03:33] [INFO ] Invariant cache hit.
[2023-03-16 22:03:34] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-16 22:03:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 22:03:34] [INFO ] Invariant cache hit.
[2023-03-16 22:03:34] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1382 ms. Remains : 396/396 places, 364/364 transitions.
Treatment of property Parking-PT-432-LTLCardinality-09 finished in 7293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 459 transition count 408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 443 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 443 transition count 392
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 427 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 425 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 425 transition count 390
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 116 place count 401 transition count 366
Applied a total of 116 rules in 36 ms. Remains 401 /460 variables (removed 59) and now considering 366/425 (removed 59) transitions.
// Phase 1: matrix 366 rows 401 cols
[2023-03-16 22:03:34] [INFO ] Computed 87 place invariants in 1 ms
[2023-03-16 22:03:35] [INFO ] Implicit Places using invariants in 484 ms returned [183, 211, 349]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 485 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/460 places, 366/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 396 transition count 364
Applied a total of 4 rules in 24 ms. Remains 396 /398 variables (removed 2) and now considering 364/366 (removed 2) transitions.
// Phase 1: matrix 364 rows 396 cols
[2023-03-16 22:03:35] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:35] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-16 22:03:35] [INFO ] Invariant cache hit.
[2023-03-16 22:03:36] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 396/460 places, 364/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1370 ms. Remains : 396/460 places, 364/425 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-11 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 s206 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 930 reset in 492 ms.
Product exploration explored 100000 steps with 937 reset in 580 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 129 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)]
Finished random walk after 935 steps, including 9 resets, run visited all 1 properties in 6 ms. (steps per millisecond=155 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 149 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 37 ms :[(NOT p0)]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 9 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-16 22:03:37] [INFO ] Invariant cache hit.
[2023-03-16 22:03:38] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-16 22:03:38] [INFO ] Invariant cache hit.
[2023-03-16 22:03:38] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2023-03-16 22:03:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 22:03:38] [INFO ] Invariant cache hit.
[2023-03-16 22:03:39] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1214 ms. Remains : 396/396 places, 364/364 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 126 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)]
Finished random walk after 1984 steps, including 19 resets, run visited all 1 properties in 12 ms. (steps per millisecond=165 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 296 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 931 reset in 499 ms.
Product exploration explored 100000 steps with 931 reset in 582 ms.
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 364/364 transitions.
Applied a total of 0 rules in 9 ms. Remains 396 /396 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2023-03-16 22:03:40] [INFO ] Invariant cache hit.
[2023-03-16 22:03:41] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-16 22:03:41] [INFO ] Invariant cache hit.
[2023-03-16 22:03:41] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-16 22:03:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 22:03:41] [INFO ] Invariant cache hit.
[2023-03-16 22:03:41] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1102 ms. Remains : 396/396 places, 364/364 transitions.
Treatment of property Parking-PT-432-LTLCardinality-11 finished in 6992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))&&F(p2))))'
Support contains 5 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Applied a total of 0 rules in 8 ms. Remains 460 /460 variables (removed 0) and now considering 425/425 (removed 0) transitions.
// Phase 1: matrix 425 rows 460 cols
[2023-03-16 22:03:41] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-16 22:03:42] [INFO ] Implicit Places using invariants in 334 ms returned [209, 239, 397]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 335 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/460 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 423
Applied a total of 4 rules in 15 ms. Remains 455 /457 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 455 cols
[2023-03-16 22:03:42] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:42] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-16 22:03:42] [INFO ] Invariant cache hit.
[2023-03-16 22:03:42] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-16 22:03:43] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/460 places, 423/425 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1497 ms. Remains : 455/460 places, 423/425 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s237 1), p2:(OR (EQ s186 0) (EQ s407 1)), p1:(OR (EQ s130 0) (EQ s3 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1766 ms.
Product exploration explored 100000 steps with 50000 reset in 1806 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 9 factoid took 269 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-432-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-432-LTLCardinality-12 finished in 5543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 459 transition count 408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 443 transition count 408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 443 transition count 392
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 427 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 425 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 425 transition count 390
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 114 place count 402 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 402 transition count 367
Applied a total of 115 rules in 42 ms. Remains 402 /460 variables (removed 58) and now considering 367/425 (removed 58) transitions.
// Phase 1: matrix 367 rows 402 cols
[2023-03-16 22:03:47] [INFO ] Computed 87 place invariants in 3 ms
[2023-03-16 22:03:47] [INFO ] Implicit Places using invariants in 321 ms returned [184, 212, 350]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 323 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/460 places, 367/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 398 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 398 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 397 transition count 365
Applied a total of 4 rules in 22 ms. Remains 397 /399 variables (removed 2) and now considering 365/367 (removed 2) transitions.
// Phase 1: matrix 365 rows 397 cols
[2023-03-16 22:03:47] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 22:03:48] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-16 22:03:48] [INFO ] Invariant cache hit.
[2023-03-16 22:03:48] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/460 places, 365/425 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1245 ms. Remains : 397/460 places, 365/425 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s155 0) (NEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLCardinality-14 finished in 1296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-16 22:03:49] [INFO ] Flatten gal took : 34 ms
[2023-03-16 22:03:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-16 22:03:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 460 places, 425 transitions and 1414 arcs took 5 ms.
Total runtime 49974 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1232/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1232/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1232/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1232/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Parking-PT-432-LTLCardinality-02
Could not compute solution for formula : Parking-PT-432-LTLCardinality-04
Could not compute solution for formula : Parking-PT-432-LTLCardinality-09
Could not compute solution for formula : Parking-PT-432-LTLCardinality-11

BK_STOP 1679004231405

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Parking-PT-432-LTLCardinality-02
ltl formula formula --ltl=/tmp/1232/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 460 places, 425 transitions and 1414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1232/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1232/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1232/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1232/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d2978453f4]
1: pnml2lts-mc(+0xa2496) [0x55d297845496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5dc5b31140]
3: pnml2lts-mc(+0x405be5) [0x55d297ba8be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d29790e3f9]
5: pnml2lts-mc(+0x164ac4) [0x55d297907ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d297a15e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d2978591f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f5dc59844d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f5dc598467a]
10: pnml2lts-mc(+0xa1581) [0x55d297844581]
11: pnml2lts-mc(+0xa1910) [0x55d297844910]
12: pnml2lts-mc(+0xa32a2) [0x55d2978462a2]
13: pnml2lts-mc(+0xa50f4) [0x55d2978480f4]
14: pnml2lts-mc(+0xa516b) [0x55d29784816b]
15: pnml2lts-mc(+0x3f34b3) [0x55d297b964b3]
16: pnml2lts-mc(+0x7c63d) [0x55d29781f63d]
17: pnml2lts-mc(+0x67d86) [0x55d29780ad86]
18: pnml2lts-mc(+0x60a8a) [0x55d297803a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d297801b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5dc596cd0a]
21: pnml2lts-mc(+0x6075e) [0x55d29780375e]
ltl formula name Parking-PT-432-LTLCardinality-04
ltl formula formula --ltl=/tmp/1232/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 460 places, 425 transitions and 1414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1232/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1232/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1232/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.000 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1232/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Parking-PT-432-LTLCardinality-09
ltl formula formula --ltl=/tmp/1232/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 460 places, 425 transitions and 1414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1232/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1232/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1232/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1232/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55caf09463f4]
1: pnml2lts-mc(+0xa2496) [0x55caf0946496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff843d37140]
3: pnml2lts-mc(+0x405be5) [0x55caf0ca9be5]
4: pnml2lts-mc(+0x16b3f9) [0x55caf0a0f3f9]
5: pnml2lts-mc(+0x164ac4) [0x55caf0a08ac4]
6: pnml2lts-mc(+0x272e0a) [0x55caf0b16e0a]
7: pnml2lts-mc(+0xb61f0) [0x55caf095a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff843b8a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff843b8a67a]
10: pnml2lts-mc(+0xa1581) [0x55caf0945581]
11: pnml2lts-mc(+0xa1910) [0x55caf0945910]
12: pnml2lts-mc(+0xa32a2) [0x55caf09472a2]
13: pnml2lts-mc(+0xa50f4) [0x55caf09490f4]
14: pnml2lts-mc(+0xa516b) [0x55caf094916b]
15: pnml2lts-mc(+0x3f34b3) [0x55caf0c974b3]
16: pnml2lts-mc(+0x7c63d) [0x55caf092063d]
17: pnml2lts-mc(+0x67d86) [0x55caf090bd86]
18: pnml2lts-mc(+0x60a8a) [0x55caf0904a8a]
19: pnml2lts-mc(+0x5eb15) [0x55caf0902b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff843b72d0a]
21: pnml2lts-mc(+0x6075e) [0x55caf090475e]
ltl formula name Parking-PT-432-LTLCardinality-11
ltl formula formula --ltl=/tmp/1232/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 460 places, 425 transitions and 1414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1232/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1232/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1232/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1232/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x560fa99573f4]
1: pnml2lts-mc(+0xa2496) [0x560fa9957496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f33cea80140]
3: pnml2lts-mc(+0x405be5) [0x560fa9cbabe5]
4: pnml2lts-mc(+0x16b3f9) [0x560fa9a203f9]
5: pnml2lts-mc(+0x164ac4) [0x560fa9a19ac4]
6: pnml2lts-mc(+0x272e0a) [0x560fa9b27e0a]
7: pnml2lts-mc(+0xb61f0) [0x560fa996b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f33ce8d34d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f33ce8d367a]
10: pnml2lts-mc(+0xa1581) [0x560fa9956581]
11: pnml2lts-mc(+0xa1910) [0x560fa9956910]
12: pnml2lts-mc(+0xa32a2) [0x560fa99582a2]
13: pnml2lts-mc(+0xa50f4) [0x560fa995a0f4]
14: pnml2lts-mc(+0xa516b) [0x560fa995a16b]
15: pnml2lts-mc(+0x3f34b3) [0x560fa9ca84b3]
16: pnml2lts-mc(+0x7c63d) [0x560fa993163d]
17: pnml2lts-mc(+0x67d86) [0x560fa991cd86]
18: pnml2lts-mc(+0x60a8a) [0x560fa9915a8a]
19: pnml2lts-mc(+0x5eb15) [0x560fa9913b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f33ce8bbd0a]
21: pnml2lts-mc(+0x6075e) [0x560fa991575e]

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
if [ "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 ;