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

About the Execution of LTSMin+red for CANConstruction-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
397.684 26931.00 44644.00 65.40 FFFFFTTFFFTFFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900627.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 21:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 21:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 21:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 21:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 641K 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 CANConstruction-PT-020-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678651213701

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:00:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 20:00:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:00:15] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-12 20:00:15] [INFO ] Transformed 1042 places.
[2023-03-12 20:00:15] [INFO ] Transformed 1760 transitions.
[2023-03-12 20:00:15] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 347 places :
Symmetric choice reduction at 0 with 347 rule applications. Total rules 347 place count 695 transition count 1066
Iterating global reduction 0 with 347 rules applied. Total rules applied 694 place count 695 transition count 1066
Applied a total of 694 rules in 158 ms. Remains 695 /1042 variables (removed 347) and now considering 1066/1760 (removed 694) transitions.
// Phase 1: matrix 1066 rows 695 cols
[2023-03-12 20:00:15] [INFO ] Computed 41 place invariants in 28 ms
[2023-03-12 20:00:16] [INFO ] Implicit Places using invariants in 599 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 636 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 676/1042 places, 1066/1760 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 657 transition count 1047
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 657 transition count 1047
Applied a total of 38 rules in 37 ms. Remains 657 /676 variables (removed 19) and now considering 1047/1066 (removed 19) transitions.
// Phase 1: matrix 1047 rows 657 cols
[2023-03-12 20:00:16] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 20:00:16] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-12 20:00:16] [INFO ] Invariant cache hit.
[2023-03-12 20:00:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:18] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/1042 places, 1047/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3181 ms. Remains : 657/1042 places, 1047/1760 transitions.
Support contains 36 out of 657 places after structural reductions.
[2023-03-12 20:00:19] [INFO ] Flatten gal took : 106 ms
[2023-03-12 20:00:19] [INFO ] Flatten gal took : 58 ms
[2023-03-12 20:00:19] [INFO ] Input system was already deterministic with 1047 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 20:00:20] [INFO ] Invariant cache hit.
[2023-03-12 20:00:20] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-12 20:00:20] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:00:20] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 62 stabilizing places and 81 stable transitions
FORMULA CANConstruction-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 657 transition count 918
Reduce places removed 129 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 130 rules applied. Total rules applied 259 place count 528 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 527 transition count 917
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 260 place count 527 transition count 898
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 298 place count 508 transition count 898
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 311 place count 495 transition count 872
Iterating global reduction 3 with 13 rules applied. Total rules applied 324 place count 495 transition count 872
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 495 transition count 864
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 340 place count 487 transition count 864
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 380 place count 467 transition count 844
Applied a total of 380 rules in 185 ms. Remains 467 /657 variables (removed 190) and now considering 844/1047 (removed 203) transitions.
// Phase 1: matrix 844 rows 467 cols
[2023-03-12 20:00:20] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-12 20:00:21] [INFO ] Implicit Places using invariants in 287 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 290 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/657 places, 844/1047 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 842
Applied a total of 4 rules in 58 ms. Remains 464 /466 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 464 cols
[2023-03-12 20:00:21] [INFO ] Computed 21 place invariants in 6 ms
[2023-03-12 20:00:21] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 20:00:21] [INFO ] Invariant cache hit.
[2023-03-12 20:00:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:23] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/657 places, 842/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2370 ms. Remains : 464/657 places, 842/1047 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s410) (LEQ 2 s31))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-00 finished in 2723 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)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 644 transition count 1021
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 644 transition count 1021
Applied a total of 26 rules in 45 ms. Remains 644 /657 variables (removed 13) and now considering 1021/1047 (removed 26) transitions.
// Phase 1: matrix 1021 rows 644 cols
[2023-03-12 20:00:23] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-12 20:00:23] [INFO ] Implicit Places using invariants in 296 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 643/657 places, 1021/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 642 transition count 1020
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 642 transition count 1020
Applied a total of 2 rules in 37 ms. Remains 642 /643 variables (removed 1) and now considering 1020/1021 (removed 1) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2023-03-12 20:00:23] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-12 20:00:24] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-12 20:00:24] [INFO ] Invariant cache hit.
[2023-03-12 20:00:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:26] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 2397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/657 places, 1020/1047 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2778 ms. Remains : 642/657 places, 1020/1047 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s374 s179)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 319 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-02 finished in 2919 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(p0))'
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 646 transition count 1025
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 646 transition count 1025
Applied a total of 22 rules in 48 ms. Remains 646 /657 variables (removed 11) and now considering 1025/1047 (removed 22) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2023-03-12 20:00:26] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-12 20:00:26] [INFO ] Implicit Places using invariants in 305 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/657 places, 1025/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1024
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1024
Applied a total of 2 rules in 33 ms. Remains 644 /645 variables (removed 1) and now considering 1024/1025 (removed 1) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2023-03-12 20:00:26] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-12 20:00:27] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-12 20:00:27] [INFO ] Invariant cache hit.
[2023-03-12 20:00:27] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:28] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/657 places, 1024/1047 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2480 ms. Remains : 644/657 places, 1024/1047 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s136 s160) (LEQ s51 s578) (LEQ s622 s407))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 10 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-03 finished in 2583 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&&X(X(p1))) U G((p2&&X(X(p3))))))'
Support contains 8 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 646 transition count 1025
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 646 transition count 1025
Applied a total of 22 rules in 25 ms. Remains 646 /657 variables (removed 11) and now considering 1025/1047 (removed 22) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2023-03-12 20:00:28] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 20:00:29] [INFO ] Implicit Places using invariants in 356 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 359 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/657 places, 1025/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1024
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1024
Applied a total of 2 rules in 31 ms. Remains 644 /645 variables (removed 1) and now considering 1024/1025 (removed 1) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2023-03-12 20:00:29] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-12 20:00:29] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-12 20:00:29] [INFO ] Invariant cache hit.
[2023-03-12 20:00:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:31] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/657 places, 1024/1047 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2637 ms. Remains : 644/657 places, 1024/1047 transitions.
Stuttering acceptance computed with spot in 541 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (AND p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=p2, acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 8}, { cond=(AND p2 p0), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND p2 p0), acceptance={0} source=4 dest: 11}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}], [{ cond=(NOT p3), acceptance={} source=6 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=7 dest: 6}], [{ cond=(NOT p3), acceptance={} source=8 dest: 5}], [{ cond=(AND p2 p0 (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=9 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=10 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p2:(LEQ s440 s25), p0:(LEQ s542 s496), p1:(GT s60 s49), p3:(GT s549 s121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-04 finished in 3209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 657 transition count 916
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 526 transition count 916
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 262 place count 526 transition count 897
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 300 place count 507 transition count 897
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 312 place count 495 transition count 873
Iterating global reduction 2 with 12 rules applied. Total rules applied 324 place count 495 transition count 873
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 332 place count 495 transition count 865
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 340 place count 487 transition count 865
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 382 place count 466 transition count 844
Applied a total of 382 rules in 111 ms. Remains 466 /657 variables (removed 191) and now considering 844/1047 (removed 203) transitions.
// Phase 1: matrix 844 rows 466 cols
[2023-03-12 20:00:32] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-12 20:00:32] [INFO ] Implicit Places using invariants in 255 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 465/657 places, 844/1047 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 463 transition count 842
Applied a total of 4 rules in 32 ms. Remains 463 /465 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 463 cols
[2023-03-12 20:00:32] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-12 20:00:32] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-12 20:00:32] [INFO ] Invariant cache hit.
[2023-03-12 20:00:33] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:34] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 463/657 places, 842/1047 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2100 ms. Remains : 463/657 places, 842/1047 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s120)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 732 reset in 565 ms.
Stack based approach found an accepted trace after 2449 steps with 17 reset with depth 104 and stack size 104 in 12 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-07 finished in 2737 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||X((G(!p1) U (p0&&G(!p1))))) U X(p2)))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 645 transition count 1023
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 645 transition count 1023
Applied a total of 24 rules in 28 ms. Remains 645 /657 variables (removed 12) and now considering 1023/1047 (removed 24) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2023-03-12 20:00:34] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-12 20:00:35] [INFO ] Implicit Places using invariants in 287 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/657 places, 1023/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 25 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2023-03-12 20:00:35] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-12 20:00:35] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-12 20:00:35] [INFO ] Invariant cache hit.
[2023-03-12 20:00:35] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:37] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/657 places, 1022/1047 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2413 ms. Remains : 643/657 places, 1022/1047 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), true, p1, (OR (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s509 s239), p2:(LEQ 1 s436), p1:(OR (LEQ s509 s239) (LEQ 1 s436))], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 373 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-09 finished in 2697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1047/1047 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 657 transition count 918
Reduce places removed 129 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 130 rules applied. Total rules applied 259 place count 528 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 527 transition count 917
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 260 place count 527 transition count 897
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 300 place count 507 transition count 897
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 313 place count 494 transition count 871
Iterating global reduction 3 with 13 rules applied. Total rules applied 326 place count 494 transition count 871
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 335 place count 494 transition count 862
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 344 place count 485 transition count 862
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 382 place count 466 transition count 843
Applied a total of 382 rules in 98 ms. Remains 466 /657 variables (removed 191) and now considering 843/1047 (removed 204) transitions.
// Phase 1: matrix 843 rows 466 cols
[2023-03-12 20:00:37] [INFO ] Computed 22 place invariants in 20 ms
[2023-03-12 20:00:38] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 20:00:38] [INFO ] Invariant cache hit.
[2023-03-12 20:00:38] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-12 20:00:39] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2023-03-12 20:00:39] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-12 20:00:39] [INFO ] Invariant cache hit.
[2023-03-12 20:00:40] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/657 places, 843/1047 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2723 ms. Remains : 466/657 places, 843/1047 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s27), p0:(OR (LEQ 3 s455) (LEQ 1 s27))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1454 steps with 36 reset in 8 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-11 finished in 2807 ms.
All properties solved by simple procedures.
Total runtime 25056 ms.
ITS solved all properties within timeout

BK_STOP 1678651240632

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="CANConstruction-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-020, 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 r041-tajo-167813694900627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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