fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r026-smll-171620167300251
Last Updated
July 7, 2024

About the Execution of ITS-Tools for AutonomousCar-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
449.552 35829.00 68979.00 369.70 TFTFTFFFFFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 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-03a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716320950720

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 19:49:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:49:13] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-21 19:49:13] [INFO ] Transformed 41 places.
[2024-05-21 19:49:13] [INFO ] Transformed 121 transitions.
[2024-05-21 19:49:13] [INFO ] Found NUPN structural information;
[2024-05-21 19:49:13] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Applied a total of 0 rules in 22 ms. Remains 41 /41 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-21 19:49:13] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 41 cols
[2024-05-21 19:49:13] [INFO ] Computed 8 invariants in 19 ms
[2024-05-21 19:49:14] [INFO ] Implicit Places using invariants in 424 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 494 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/41 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 557 ms. Remains : 40/41 places, 76/76 transitions.
Support contains 22 out of 40 places after structural reductions.
[2024-05-21 19:49:14] [INFO ] Flatten gal took : 72 ms
[2024-05-21 19:49:14] [INFO ] Flatten gal took : 32 ms
[2024-05-21 19:49:14] [INFO ] Input system was already deterministic with 76 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 2100 steps (127 resets) in 425 ms. (4 steps per ms) remains 0/18 properties
FORMULA AutonomousCar-PT-03a-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 17 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-05-21 19:49:15] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 19:49:15] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 19:49:15] [INFO ] Invariant cache hit.
[2024-05-21 19:49:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:15] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 279 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 63/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 34/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 454 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-01 finished in 853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(F(p0))))&&G(p1)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 5 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 37 cols
[2024-05-21 19:49:16] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 19:49:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 19:49:16] [INFO ] Invariant cache hit.
[2024-05-21 19:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:16] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 241 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 67/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 248 ms. Remains : 35/40 places, 67/76 transitions.
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-03 finished in 726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 5 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
[2024-05-21 19:49:16] [INFO ] Invariant cache hit.
[2024-05-21 19:49:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 19:49:17] [INFO ] Invariant cache hit.
[2024-05-21 19:49:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:17] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 218 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 67/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 35/40 places, 67/76 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 957 ms.
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 849 steps (43 resets) in 23 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 67/67 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 35 cols
[2024-05-21 19:49:19] [INFO ] Computed 4 invariants in 8 ms
[2024-05-21 19:49:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 19:49:19] [INFO ] Invariant cache hit.
[2024-05-21 19:49:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:19] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:49:19] [INFO ] Invariant cache hit.
[2024-05-21 19:49:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/101 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:49:21] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/102 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 41 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2487 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/101 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 66/106 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:49:23] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 108 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3633 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 6342ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 6359ms
Finished structural reductions in LTL mode , in 1 iterations and 6564 ms. Remains : 35/35 places, 67/67 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 920 steps (52 resets) in 38 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 327 ms.
Product exploration explored 100000 steps with 25000 reset in 272 ms.
Built C files in :
/tmp/ltsmin1992019777268099105
[2024-05-21 19:49:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1992019777268099105
Running compilation step : cd /tmp/ltsmin1992019777268099105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 825 ms.
Running link step : cd /tmp/ltsmin1992019777268099105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin1992019777268099105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15565669143852708287.hoa' '--buchi-type=spotba'
LTSmin run took 518 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLCardinality-04 finished in 13050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 3 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-05-21 19:49:29] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 19:49:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 19:49:30] [INFO ] Invariant cache hit.
[2024-05-21 19:49:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:30] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 34/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-05
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 3 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-05 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 67
Applied a total of 6 rules in 3 ms. Remains 37 /40 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 37 cols
[2024-05-21 19:49:30] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:49:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 19:49:30] [INFO ] Invariant cache hit.
[2024-05-21 19:49:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:30] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 212 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 67/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 35/40 places, 67/76 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 56 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-07 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 2 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-05-21 19:49:30] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:49:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 19:49:30] [INFO ] Invariant cache hit.
[2024-05-21 19:49:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:30] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 194 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/40 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198 ms. Remains : 34/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-08 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 64
Applied a total of 6 rules in 3 ms. Remains 37 /40 variables (removed 3) and now considering 64/76 (removed 12) transitions.
[2024-05-21 19:49:31] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
// Phase 1: matrix 63 rows 37 cols
[2024-05-21 19:49:31] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 19:49:31] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-05-21 19:49:31] [INFO ] Invariant cache hit.
[2024-05-21 19:49:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [32, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 64/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 35/40 places, 64/76 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 69 steps with 3 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-11 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (F(p1)||X(p2))))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 40 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 34 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 34 transition count 64
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 2 with 2 rules applied. Total rules applied 14 place count 33 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 32 transition count 63
Applied a total of 16 rules in 22 ms. Remains 32 /40 variables (removed 8) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 32 cols
[2024-05-21 19:49:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:49:31] [INFO ] Invariant cache hit.
[2024-05-21 19:49:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 119 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/40 places, 63/76 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 30 transition count 62
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 29 transition count 62
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 28 transition count 61
Applied a total of 4 rules in 12 ms. Remains 28 /30 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 28 cols
[2024-05-21 19:49:31] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:49:31] [INFO ] Invariant cache hit.
[2024-05-21 19:49:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/40 places, 61/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 28/40 places, 61/76 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 6 reset in 235 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 235 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 40000 steps (3005 resets) in 289 ms. (137 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (492 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
[2024-05-21 19:49:32] [INFO ] Invariant cache hit.
[2024-05-21 19:49:32] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/89 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/28 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p0) p1)))), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 14 factoid took 544 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-21 19:49:33] [INFO ] Invariant cache hit.
[2024-05-21 19:49:33] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:49:33] [INFO ] Invariant cache hit.
[2024-05-21 19:49:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:49:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-21 19:49:33] [INFO ] Redundant transitions in 21 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 19:49:33] [INFO ] Invariant cache hit.
[2024-05-21 19:49:33] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/88 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 34 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/88 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 60/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 94 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2902 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4698ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4700ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4886 ms. Remains : 28/28 places, 61/61 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 258 steps (21 resets) in 10 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 80 ms.
Product exploration explored 100000 steps with 16 reset in 378 ms.
Built C files in :
/tmp/ltsmin14112627313254817731
[2024-05-21 19:49:39] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-21 19:49:39] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:39] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-21 19:49:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:39] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-21 19:49:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:39] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14112627313254817731
Running compilation step : cd /tmp/ltsmin14112627313254817731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin14112627313254817731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14112627313254817731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14681175643104695335.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLCardinality-12 finished in 9241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 rules in 3 ms. Remains 36 /40 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 36 cols
[2024-05-21 19:49:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:49:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 19:49:40] [INFO ] Invariant cache hit.
[2024-05-21 19:49:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:40] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 35/40 places, 63/76 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 34 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-13 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 31 transition count 58
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 31 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 56
Applied a total of 20 rules in 13 ms. Remains 29 /40 variables (removed 11) and now considering 56/76 (removed 20) transitions.
// Phase 1: matrix 56 rows 29 cols
[2024-05-21 19:49:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:49:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:49:41] [INFO ] Invariant cache hit.
[2024-05-21 19:49:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:41] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [25, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 162 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/40 places, 56/76 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 27 transition count 55
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 26 transition count 55
Applied a total of 2 rules in 7 ms. Remains 26 /27 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 26 cols
[2024-05-21 19:49:41] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:49:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:49:41] [INFO ] Invariant cache hit.
[2024-05-21 19:49:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:41] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/40 places, 55/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 318 ms. Remains : 26/40 places, 55/76 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-14
Product exploration explored 100000 steps with 5 reset in 86 ms.
Product exploration explored 100000 steps with 17 reset in 208 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 47 ms :[(NOT p0)]
RANDOM walk for 173 steps (10 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-21 19:49:42] [INFO ] Invariant cache hit.
[2024-05-21 19:49:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:49:42] [INFO ] Invariant cache hit.
[2024-05-21 19:49:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:49:42] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-21 19:49:42] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-21 19:49:42] [INFO ] Invariant cache hit.
[2024-05-21 19:49:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 54/80 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-21 19:49:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2024-05-21 19:49:42] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 33 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/80 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 54/86 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 87 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
After SMT, in 2739ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2741ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2906 ms. Remains : 26/26 places, 55/55 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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)]
RANDOM walk for 433 steps (34 resets) in 7 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 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)]
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 9 reset in 84 ms.
Product exploration explored 100000 steps with 9 reset in 394 ms.
Built C files in :
/tmp/ltsmin17536722669745985000
[2024-05-21 19:49:45] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-21 19:49:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:45] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-21 19:49:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:45] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-21 19:49:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17536722669745985000
Running compilation step : cd /tmp/ltsmin17536722669745985000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 252 ms.
Running link step : cd /tmp/ltsmin17536722669745985000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17536722669745985000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17590632807288309459.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLCardinality-14 finished in 5228 ms.
All properties solved by simple procedures.
Total runtime 33185 ms.

BK_STOP 1716320986549

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-03a"
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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-03a, 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 r026-smll-171620167300251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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