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

About the Execution of ITS-Tools for AutonomousCar-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9722.376 3600000.00 12503335.00 580.10 FTFFTFT?FFTFFFFT 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.r005-oct2-167813593500667.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593500667
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 865K Mar 5 18:22 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 AutonomousCar-PT-09b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678522405822

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 08:13:28] [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]
[2023-03-11 08:13:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:13:28] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-11 08:13:28] [INFO ] Transformed 391 places.
[2023-03-11 08:13:28] [INFO ] Transformed 1554 transitions.
[2023-03-11 08:13:28] [INFO ] Found NUPN structural information;
[2023-03-11 08:13:28] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 341 transition count 1504
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 341 transition count 1504
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 424 place count 341 transition count 1180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 434 place count 331 transition count 1170
Iterating global reduction 1 with 10 rules applied. Total rules applied 444 place count 331 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 445 place count 330 transition count 1169
Iterating global reduction 1 with 1 rules applied. Total rules applied 446 place count 330 transition count 1169
Applied a total of 446 rules in 138 ms. Remains 330 /391 variables (removed 61) and now considering 1169/1554 (removed 385) transitions.
// Phase 1: matrix 1169 rows 330 cols
[2023-03-11 08:13:28] [INFO ] Computed 14 place invariants in 33 ms
[2023-03-11 08:13:29] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-11 08:13:29] [INFO ] Invariant cache hit.
[2023-03-11 08:13:30] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2023-03-11 08:13:30] [INFO ] Invariant cache hit.
[2023-03-11 08:13:31] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/391 places, 1169/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2626 ms. Remains : 330/391 places, 1169/1554 transitions.
Support contains 34 out of 330 places after structural reductions.
[2023-03-11 08:13:31] [INFO ] Flatten gal took : 208 ms
[2023-03-11 08:13:31] [INFO ] Flatten gal took : 124 ms
[2023-03-11 08:13:31] [INFO ] Input system was already deterministic with 1169 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 08:13:32] [INFO ] Invariant cache hit.
[2023-03-11 08:13:32] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 08:13:32] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:13:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 08:13:33] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 08:13:34] [INFO ] Deduced a trap composed of 33 places in 655 ms of which 7 ms to minimize.
[2023-03-11 08:13:34] [INFO ] Deduced a trap composed of 35 places in 539 ms of which 2 ms to minimize.
[2023-03-11 08:13:35] [INFO ] Deduced a trap composed of 32 places in 449 ms of which 1 ms to minimize.
[2023-03-11 08:13:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1794 ms
[2023-03-11 08:13:35] [INFO ] After 2596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-11 08:13:35] [INFO ] After 2929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 107 ms.
Support contains 9 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Graph (trivial) has 300 edges and 330 vertex of which 4 / 330 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1591 edges and 328 vertex of which 326 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 326 transition count 1047
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 162 rules applied. Total rules applied 282 place count 209 transition count 1002
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 28 rules applied. Total rules applied 310 place count 183 transition count 1000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 312 place count 181 transition count 1000
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 312 place count 181 transition count 992
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 328 place count 173 transition count 992
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 330 place count 171 transition count 990
Iterating global reduction 4 with 2 rules applied. Total rules applied 332 place count 171 transition count 990
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 480 place count 97 transition count 916
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 497 place count 80 transition count 763
Iterating global reduction 4 with 17 rules applied. Total rules applied 514 place count 80 transition count 763
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 521 place count 80 transition count 756
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 524 place count 80 transition count 753
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 535 place count 80 transition count 742
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 546 place count 69 transition count 742
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 548 place count 69 transition count 740
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 69 transition count 740
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 550 place count 68 transition count 739
Applied a total of 550 rules in 457 ms. Remains 68 /330 variables (removed 262) and now considering 739/1169 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 68/330 places, 739/1169 transitions.
Finished random walk after 932 steps, including 31 resets, run visited all 4 properties in 12 ms. (steps per millisecond=77 )
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-09b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 51 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' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Graph (trivial) has 311 edges and 330 vertex of which 4 / 330 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 327 transition count 1045
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 173 rules applied. Total rules applied 295 place count 206 transition count 993
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 327 place count 175 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 174 transition count 992
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 328 place count 174 transition count 985
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 342 place count 167 transition count 985
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 348 place count 161 transition count 979
Iterating global reduction 4 with 6 rules applied. Total rules applied 354 place count 161 transition count 979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 354 place count 161 transition count 978
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 160 transition count 978
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 159 transition count 969
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 159 transition count 969
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 159 transition count 968
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 499 place count 89 transition count 897
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 517 place count 71 transition count 734
Iterating global reduction 5 with 18 rules applied. Total rules applied 535 place count 71 transition count 734
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 543 place count 71 transition count 726
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 6 with 2 rules applied. Total rules applied 545 place count 70 transition count 725
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 546 place count 70 transition count 725
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 548 place count 68 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 549 place count 67 transition count 723
Applied a total of 549 rules in 373 ms. Remains 67 /330 variables (removed 263) and now considering 723/1169 (removed 446) transitions.
// Phase 1: matrix 723 rows 67 cols
[2023-03-11 08:13:37] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-11 08:13:37] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-11 08:13:37] [INFO ] Invariant cache hit.
[2023-03-11 08:13:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:13:38] [INFO ] Implicit Places using invariants and state equation in 665 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1312 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/330 places, 723/1169 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 64 transition count 722
Applied a total of 2 rules in 83 ms. Remains 64 /65 variables (removed 1) and now considering 722/723 (removed 1) transitions.
// Phase 1: matrix 722 rows 64 cols
[2023-03-11 08:13:38] [INFO ] Computed 10 place invariants in 12 ms
[2023-03-11 08:13:38] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-11 08:13:38] [INFO ] Invariant cache hit.
[2023-03-11 08:13:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:13:39] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/330 places, 722/1169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2920 ms. Remains : 64/330 places, 722/1169 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-00 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s45 0), p1:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 44 steps with 2 reset in 9 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-00 finished in 3479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((p0 U p1)||G(F(p0)))) U p0)))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 320 transition count 1159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 320 transition count 1159
Applied a total of 20 rules in 31 ms. Remains 320 /330 variables (removed 10) and now considering 1159/1169 (removed 10) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-11 08:13:40] [INFO ] Computed 14 place invariants in 15 ms
[2023-03-11 08:13:40] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-11 08:13:40] [INFO ] Invariant cache hit.
[2023-03-11 08:13:41] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
[2023-03-11 08:13:41] [INFO ] Invariant cache hit.
[2023-03-11 08:13:42] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 1159/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2010 ms. Remains : 320/330 places, 1159/1169 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s202 0) (EQ s234 1)), p1:(OR (EQ s281 0) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Computed a total of 49 stabilizing places and 50 stable transitions
Computed a total of 49 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-01 finished in 3395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 319 transition count 1158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 319 transition count 1158
Applied a total of 22 rules in 34 ms. Remains 319 /330 variables (removed 11) and now considering 1158/1169 (removed 11) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-11 08:13:43] [INFO ] Computed 14 place invariants in 18 ms
[2023-03-11 08:13:44] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-11 08:13:44] [INFO ] Invariant cache hit.
[2023-03-11 08:13:44] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2023-03-11 08:13:44] [INFO ] Invariant cache hit.
[2023-03-11 08:13:45] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/330 places, 1158/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 319/330 places, 1158/1169 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s27 0) (EQ s225 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 AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-02 finished in 1988 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(F(p0))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 319 transition count 1158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 319 transition count 1158
Applied a total of 22 rules in 27 ms. Remains 319 /330 variables (removed 11) and now considering 1158/1169 (removed 11) transitions.
[2023-03-11 08:13:45] [INFO ] Invariant cache hit.
[2023-03-11 08:13:45] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-11 08:13:45] [INFO ] Invariant cache hit.
[2023-03-11 08:13:46] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2023-03-11 08:13:46] [INFO ] Invariant cache hit.
[2023-03-11 08:13:47] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/330 places, 1158/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2099 ms. Remains : 319/330 places, 1158/1169 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s22 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 313 ms.
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Detected a total of 48/319 stabilizing places and 49/1158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-04 finished in 2931 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((X(p0)&&F(p1))))'
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 320 transition count 1159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 320 transition count 1159
Applied a total of 20 rules in 34 ms. Remains 320 /330 variables (removed 10) and now considering 1159/1169 (removed 10) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-11 08:13:48] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-11 08:13:48] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-11 08:13:48] [INFO ] Invariant cache hit.
[2023-03-11 08:13:49] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2023-03-11 08:13:49] [INFO ] Invariant cache hit.
[2023-03-11 08:13:50] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/330 places, 1159/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2068 ms. Remains : 320/330 places, 1159/1169 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s29 0) (EQ s117 1)), p0:(EQ s254 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 243 steps with 6 reset in 3 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-05 finished in 2241 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(F(p1))||p0))))'
Support contains 5 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Graph (trivial) has 306 edges and 330 vertex of which 4 / 330 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 327 transition count 1048
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 164 rules applied. Total rules applied 283 place count 209 transition count 1002
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 311 place count 182 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 181 transition count 1001
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 312 place count 181 transition count 992
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 330 place count 172 transition count 992
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 335 place count 167 transition count 987
Iterating global reduction 4 with 5 rules applied. Total rules applied 340 place count 167 transition count 987
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 341 place count 166 transition count 978
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 166 transition count 978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 344 place count 166 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 345 place count 165 transition count 976
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 487 place count 94 transition count 904
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 504 place count 77 transition count 751
Iterating global reduction 6 with 17 rules applied. Total rules applied 521 place count 77 transition count 751
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 529 place count 77 transition count 743
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 7 with 2 rules applied. Total rules applied 531 place count 76 transition count 742
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 533 place count 76 transition count 742
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 535 place count 74 transition count 740
Applied a total of 535 rules in 240 ms. Remains 74 /330 variables (removed 256) and now considering 740/1169 (removed 429) transitions.
// Phase 1: matrix 740 rows 74 cols
[2023-03-11 08:13:50] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-11 08:13:51] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-11 08:13:51] [INFO ] Invariant cache hit.
[2023-03-11 08:13:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:13:52] [INFO ] Implicit Places using invariants and state equation in 733 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1200 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/330 places, 740/1169 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 739
Applied a total of 2 rules in 80 ms. Remains 71 /72 variables (removed 1) and now considering 739/740 (removed 1) transitions.
// Phase 1: matrix 739 rows 71 cols
[2023-03-11 08:13:52] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-11 08:13:52] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-11 08:13:52] [INFO ] Invariant cache hit.
[2023-03-11 08:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:13:53] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/330 places, 739/1169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2596 ms. Remains : 71/330 places, 739/1169 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-07 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 (NEQ s64 1) (AND (NEQ s44 0) (NEQ s30 1))), p1:(AND (NEQ s0 0) (NEQ s22 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 856 reset in 211 ms.
Product exploration explored 100000 steps with 238 reset in 140 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 313 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7512 steps, including 420 resets, run visited all 2 properties in 154 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 304 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 739/739 transitions.
Applied a total of 0 rules in 61 ms. Remains 71 /71 variables (removed 0) and now considering 739/739 (removed 0) transitions.
[2023-03-11 08:13:54] [INFO ] Invariant cache hit.
[2023-03-11 08:13:55] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-11 08:13:55] [INFO ] Invariant cache hit.
[2023-03-11 08:13:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:13:56] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-11 08:13:56] [INFO ] Redundant transitions in 70 ms returned [733]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 738 rows 71 cols
[2023-03-11 08:13:56] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-11 08:13:56] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/71 places, 738/739 transitions.
Reduce places removed 1 places and 1 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 69 transition count 738
Applied a total of 2 rules in 36 ms. Remains 69 /71 variables (removed 2) and now considering 738/738 (removed 0) transitions.
// Phase 1: matrix 738 rows 69 cols
[2023-03-11 08:13:56] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-11 08:13:57] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-11 08:13:57] [INFO ] Invariant cache hit.
[2023-03-11 08:13:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:13:57] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/71 places, 738/739 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2920 ms. Remains : 69/71 places, 738/739 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 (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 272 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 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 602 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 08:13:58] [INFO ] Invariant cache hit.
[2023-03-11 08:13:58] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:13:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-11 08:13:58] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:13:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:13:58] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:13:59] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 1 ms to minimize.
[2023-03-11 08:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-11 08:13:59] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 08:13:59] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 738/738 transitions.
Graph (complete) has 845 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 68 transition count 735
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 68 transition count 725
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 58 transition count 725
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 58 transition count 723
Applied a total of 25 rules in 86 ms. Remains 58 /69 variables (removed 11) and now considering 723/738 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 58/69 places, 723/738 transitions.
Finished random walk after 1278 steps, including 16 resets, run visited all 1 properties in 10 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 372 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 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1455 reset in 206 ms.
Product exploration explored 100000 steps with 1649 reset in 209 ms.
Built C files in :
/tmp/ltsmin11980860050992838348
[2023-03-11 08:14:00] [INFO ] Computing symmetric may disable matrix : 738 transitions.
[2023-03-11 08:14:00] [INFO ] Computation of Complete disable matrix. took 94 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:14:00] [INFO ] Computing symmetric may enable matrix : 738 transitions.
[2023-03-11 08:14:00] [INFO ] Computation of Complete enable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:14:00] [INFO ] Computing Do-Not-Accords matrix : 738 transitions.
[2023-03-11 08:14:00] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:14:01] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11980860050992838348
Running compilation step : cd /tmp/ltsmin11980860050992838348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11980860050992838348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11980860050992838348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 738/738 transitions.
Applied a total of 0 rules in 37 ms. Remains 69 /69 variables (removed 0) and now considering 738/738 (removed 0) transitions.
[2023-03-11 08:14:04] [INFO ] Invariant cache hit.
[2023-03-11 08:14:04] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-11 08:14:04] [INFO ] Invariant cache hit.
[2023-03-11 08:14:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:14:05] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2023-03-11 08:14:05] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-11 08:14:05] [INFO ] Invariant cache hit.
[2023-03-11 08:14:05] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1563 ms. Remains : 69/69 places, 738/738 transitions.
Built C files in :
/tmp/ltsmin8229957589597459886
[2023-03-11 08:14:05] [INFO ] Computing symmetric may disable matrix : 738 transitions.
[2023-03-11 08:14:05] [INFO ] Computation of Complete disable matrix. took 73 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:14:05] [INFO ] Computing symmetric may enable matrix : 738 transitions.
[2023-03-11 08:14:05] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:14:05] [INFO ] Computing Do-Not-Accords matrix : 738 transitions.
[2023-03-11 08:14:05] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:14:05] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8229957589597459886
Running compilation step : cd /tmp/ltsmin8229957589597459886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8229957589597459886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8229957589597459886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 08:14:09] [INFO ] Flatten gal took : 120 ms
[2023-03-11 08:14:09] [INFO ] Flatten gal took : 106 ms
[2023-03-11 08:14:09] [INFO ] Time to serialize gal into /tmp/LTL6452623360766199918.gal : 21 ms
[2023-03-11 08:14:09] [INFO ] Time to serialize properties into /tmp/LTL3041521570430977203.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6452623360766199918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13994368980061089559.hoa' '-atoms' '/tmp/LTL3041521570430977203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3041521570430977203.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13994368980061089559.hoa
Detected timeout of ITS tools.
[2023-03-11 08:14:24] [INFO ] Flatten gal took : 194 ms
[2023-03-11 08:14:25] [INFO ] Flatten gal took : 193 ms
[2023-03-11 08:14:25] [INFO ] Time to serialize gal into /tmp/LTL336666818230460082.gal : 26 ms
[2023-03-11 08:14:25] [INFO ] Time to serialize properties into /tmp/LTL418013457284732214.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL336666818230460082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL418013457284732214.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((F(G((("(p332!=1)")||(X(F("((p5!=0)&&(p106!=1))"))))||("((p222!=0)&&(p143!=1))")))))
Formula 0 simplified : G(F(!"((p222!=0)&&(p143!=1))" & !"(p332!=1)") & FG!"((p5!=0)&&(p106!=1))")
Detected timeout of ITS tools.
[2023-03-11 08:14:40] [INFO ] Flatten gal took : 115 ms
[2023-03-11 08:14:40] [INFO ] Applying decomposition
[2023-03-11 08:14:40] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16190806000412262320.txt' '-o' '/tmp/graph16190806000412262320.bin' '-w' '/tmp/graph16190806000412262320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16190806000412262320.bin' '-l' '-1' '-v' '-w' '/tmp/graph16190806000412262320.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:14:40] [INFO ] Decomposing Gal with order
[2023-03-11 08:14:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:14:40] [INFO ] Removed a total of 5417 redundant transitions.
[2023-03-11 08:14:41] [INFO ] Flatten gal took : 183 ms
[2023-03-11 08:14:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 59 ms.
[2023-03-11 08:14:41] [INFO ] Time to serialize gal into /tmp/LTL6337799138826874744.gal : 12 ms
[2023-03-11 08:14:41] [INFO ] Time to serialize properties into /tmp/LTL7182653119167931507.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6337799138826874744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7182653119167931507.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((("(u20.p332!=1)")||(X(F("((u20.p5!=0)&&(i1.u4.p106!=1))"))))||("((u12.p222!=0)&&(i2.u7.p143!=1))")))))
Formula 0 simplified : G(F(!"((u12.p222!=0)&&(i2.u7.p143!=1))" & !"(u20.p332!=1)") & FG!"((u20.p5!=0)&&(i1.u4.p106!=1))")
Reverse transition relation is NOT exact ! Due to transitions u12.t156, u12.t155.t157, u13.t152, u20.t314, u20.t22.t15.t16.t640.t310.t642.t311.t17.t18.t42,...761
Computing Next relation with stutter on 412301 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18238910031366224767
[2023-03-11 08:14:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18238910031366224767
Running compilation step : cd /tmp/ltsmin18238910031366224767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2074 ms.
Running link step : cd /tmp/ltsmin18238910031366224767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin18238910031366224767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-09b-LTLCardinality-07 finished in 80699 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' '!(((p0&&G(p1)) U (p2 U X(p3))))'
Support contains 6 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 1169/1169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 1160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 1160
Applied a total of 18 rules in 15 ms. Remains 321 /330 variables (removed 9) and now considering 1160/1169 (removed 9) transitions.
// Phase 1: matrix 1160 rows 321 cols
[2023-03-11 08:15:11] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-11 08:15:11] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-11 08:15:11] [INFO ] Invariant cache hit.
[2023-03-11 08:15:12] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2023-03-11 08:15:12] [INFO ] Invariant cache hit.
[2023-03-11 08:15:13] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/330 places, 1160/1169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1989 ms. Remains : 321/330 places, 1160/1169 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s198 0) (EQ s58 1)), p0:(OR (EQ s231 0) (EQ s117 1)), p1:(OR (EQ s231 0) (EQ s117 1) (EQ s63 0) (EQ s17 1)), p3:(OR (EQ s63 0) (EQ s17 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3), (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) p0 p1 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p1)), true, (X (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 21 factoid took 544 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-15 finished in 3790 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(F(p1))||p0))))'
[2023-03-11 08:15:15] [INFO ] Flatten gal took : 119 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15639795070612057973
[2023-03-11 08:15:15] [INFO ] Computing symmetric may disable matrix : 1169 transitions.
[2023-03-11 08:15:15] [INFO ] Applying decomposition
[2023-03-11 08:15:15] [INFO ] Computation of Complete disable matrix. took 79 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:15] [INFO ] Flatten gal took : 75 ms
[2023-03-11 08:15:15] [INFO ] Computing symmetric may enable matrix : 1169 transitions.
[2023-03-11 08:15:15] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16100712897690769135.txt' '-o' '/tmp/graph16100712897690769135.bin' '-w' '/tmp/graph16100712897690769135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16100712897690769135.bin' '-l' '-1' '-v' '-w' '/tmp/graph16100712897690769135.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:15:15] [INFO ] Decomposing Gal with order
[2023-03-11 08:15:15] [INFO ] Computing Do-Not-Accords matrix : 1169 transitions.
[2023-03-11 08:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:15:16] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:15:16] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15639795070612057973
Running compilation step : cd /tmp/ltsmin15639795070612057973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 08:15:16] [INFO ] Removed a total of 6062 redundant transitions.
[2023-03-11 08:15:16] [INFO ] Flatten gal took : 142 ms
[2023-03-11 08:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 33 ms.
[2023-03-11 08:15:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality11371076012588189445.gal : 4 ms
[2023-03-11 08:15:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality18056725581298980458.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11371076012588189445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18056725581298980458.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i18.u104.p332!=1)||((i2.u69.p222!=0)&&(i7.u45.p143!=1)))")||(X(F("((i16.u1.p5!=0)&&(i5.u33.p106!=1))")))))))
Formula 0 simplified : G(F!"((i18.u104.p332!=1)||((i2.u69.p222!=0)&&(i7.u45.p143!=1)))" & FG!"((i16.u1.p5!=0)&&(i5.u33.p106!=1))")
Compilation finished in 5217 ms.
Running link step : cd /tmp/ltsmin15639795070612057973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 110 ms.
Running LTSmin : cd /tmp/ltsmin15639795070612057973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t89, t115, t144, t145, t172, t198, t226, t253, t279, t304, t311, t313, t317, t398, t425, t116...1028
Computing Next relation with stutter on 7.84947e+06 deadlock states
Detected timeout of ITS tools.
[2023-03-11 08:35:51] [INFO ] Applying decomposition
[2023-03-11 08:35:52] [INFO ] Flatten gal took : 176 ms
[2023-03-11 08:35:52] [INFO ] Decomposing Gal with order
[2023-03-11 08:35:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:35:52] [INFO ] Removed a total of 6354 redundant transitions.
[2023-03-11 08:35:52] [INFO ] Flatten gal took : 376 ms
[2023-03-11 08:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 102 ms.
[2023-03-11 08:35:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality7460814682705094715.gal : 6 ms
[2023-03-11 08:35:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality3937780764925362948.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7460814682705094715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3937780764925362948.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i1.i0.u23.p332!=1)||((i1.i0.i0.i0.i0.i0.u19.p222!=0)&&(i1.i0.i0.i0.i0.i0.i0.i0.u17.p143!=1)))")||(X(F("((i0.u2.p5!=0)&&(i1....200
Formula 0 simplified : G(F!"((i1.i0.u23.p332!=1)||((i1.i0.i0.i0.i0.i0.u19.p222!=0)&&(i1.i0.i0.i0.i0.i0.i0.i0.u17.p143!=1)))" & FG!"((i0.u2.p5!=0)&&(i1.i0.i...190
Reverse transition relation is NOT exact ! Due to transitions t511, t538, t619, i0.u2.t313, i0.u2.t314, i0.u2.t315, i0.u3.t311, i1.t1166, i1.i0.u23.t34, i1...2074
Computing Next relation with stutter on 7.84947e+06 deadlock states
Detected timeout of ITS tools.
[2023-03-11 08:56:28] [INFO ] Flatten gal took : 175 ms
[2023-03-11 08:56:28] [INFO ] Input system was already deterministic with 1169 transitions.
[2023-03-11 08:56:28] [INFO ] Transformed 330 places.
[2023-03-11 08:56:28] [INFO ] Transformed 1169 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 08:56:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality8273002090010034382.gal : 17 ms
[2023-03-11 08:56:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality1492578787485981173.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8273002090010034382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1492578787485981173.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((p332!=1)||((p222!=0)&&(p143!=1)))")||(X(F("((p5!=0)&&(p106!=1))")))))))
Formula 0 simplified : G(F!"((p332!=1)||((p222!=0)&&(p143!=1)))" & FG!"((p5!=0)&&(p106!=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.216: LTL layer: formula: <>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.216: "<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.216: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.301: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.303: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.314: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.336: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.345: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.347: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.360: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.561: There are 1172 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.561: State length is 331, there are 1175 groups
pins2lts-mc-linux64( 0/ 8), 0.561: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.561: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.561: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.561: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.672: [Blue] ~108 levels ~960 states ~5680 transitions
pins2lts-mc-linux64( 1/ 8), 0.699: [Blue] ~128 levels ~1920 states ~9952 transitions
pins2lts-mc-linux64( 1/ 8), 0.747: [Blue] ~128 levels ~3840 states ~16776 transitions
pins2lts-mc-linux64( 7/ 8), 0.858: [Blue] ~127 levels ~7680 states ~33000 transitions
pins2lts-mc-linux64( 0/ 8), 1.063: [Blue] ~109 levels ~15360 states ~68248 transitions
pins2lts-mc-linux64( 0/ 8), 1.505: [Blue] ~109 levels ~30720 states ~144504 transitions
pins2lts-mc-linux64( 0/ 8), 2.292: [Blue] ~119 levels ~61440 states ~286656 transitions
pins2lts-mc-linux64( 0/ 8), 3.877: [Blue] ~119 levels ~122880 states ~628016 transitions
pins2lts-mc-linux64( 6/ 8), 6.963: [Blue] ~108 levels ~245760 states ~1363712 transitions
pins2lts-mc-linux64( 6/ 8), 12.714: [Blue] ~108 levels ~491520 states ~2870224 transitions
pins2lts-mc-linux64( 6/ 8), 23.410: [Blue] ~108 levels ~983040 states ~5957632 transitions
pins2lts-mc-linux64( 6/ 8), 44.327: [Blue] ~114 levels ~1966080 states ~11535872 transitions
pins2lts-mc-linux64( 7/ 8), 85.769: [Blue] ~127 levels ~3932160 states ~26056816 transitions
pins2lts-mc-linux64( 7/ 8), 169.072: [Blue] ~138 levels ~7864320 states ~52604568 transitions
pins2lts-mc-linux64( 2/ 8), 334.671: [Blue] ~154 levels ~15728640 states ~90570576 transitions
pins2lts-mc-linux64( 2/ 8), 668.031: [Blue] ~154 levels ~31457280 states ~189641232 transitions
pins2lts-mc-linux64( 2/ 8), 1338.043: [Blue] ~201 levels ~62914560 states ~386067088 transitions
pins2lts-mc-linux64( 2/ 8), 2686.889: [Blue] ~262 levels ~125829120 states ~769321168 transitions
pins2lts-mc-linux64( 3/ 8), 2937.134: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2937.184:
pins2lts-mc-linux64( 0/ 8), 2937.184: Explored 134210101 states 1010756234 transitions, fanout: 7.531
pins2lts-mc-linux64( 0/ 8), 2937.184: Total exploration time 2936.620 sec (2936.560 sec minimum, 2936.586 sec on average)
pins2lts-mc-linux64( 0/ 8), 2937.184: States per second: 45702, Transitions per second: 344190
pins2lts-mc-linux64( 0/ 8), 2937.184:
pins2lts-mc-linux64( 0/ 8), 2937.184: State space has 134217297 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 2937.184: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2937.184: blue states: 134210101 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2937.184: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2937.184: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2937.184:
pins2lts-mc-linux64( 0/ 8), 2937.184: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 2937.184:
pins2lts-mc-linux64( 0/ 8), 2937.184: Queue width: 8B, total height: 1627, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 2937.184: Tree memory: 1027.8MB, 8.0 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 2937.184: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 2937.184: Stored 1200 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2937.184: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2937.184: Est. total memory use: 1027.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15639795070612057973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15639795070612057973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9917732 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16035236 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="AutonomousCar-PT-09b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-09b, 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 r005-oct2-167813593500667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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