About the Execution of ITS-Tools for Referendum-PT-1000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7021.447 | 625775.00 | 1692472.00 | 378.60 | FFFTTTFTFFTFTFFT | 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/mcc2022-input.r186-tajo-165281572300451.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-PT-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572300451
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 884K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 350K Apr 29 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 29 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 347K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 233K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 99K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 244K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 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 Referendum-PT-1000-LTLCardinality-00
FORMULA_NAME Referendum-PT-1000-LTLCardinality-01
FORMULA_NAME Referendum-PT-1000-LTLCardinality-02
FORMULA_NAME Referendum-PT-1000-LTLCardinality-03
FORMULA_NAME Referendum-PT-1000-LTLCardinality-04
FORMULA_NAME Referendum-PT-1000-LTLCardinality-05
FORMULA_NAME Referendum-PT-1000-LTLCardinality-06
FORMULA_NAME Referendum-PT-1000-LTLCardinality-07
FORMULA_NAME Referendum-PT-1000-LTLCardinality-08
FORMULA_NAME Referendum-PT-1000-LTLCardinality-09
FORMULA_NAME Referendum-PT-1000-LTLCardinality-10
FORMULA_NAME Referendum-PT-1000-LTLCardinality-11
FORMULA_NAME Referendum-PT-1000-LTLCardinality-12
FORMULA_NAME Referendum-PT-1000-LTLCardinality-13
FORMULA_NAME Referendum-PT-1000-LTLCardinality-14
FORMULA_NAME Referendum-PT-1000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653084103593
Running Version 202205111006
[2022-05-20 22:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:01:45] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2022-05-20 22:01:45] [INFO ] Transformed 3001 places.
[2022-05-20 22:01:45] [INFO ] Transformed 2001 transitions.
[2022-05-20 22:01:45] [INFO ] Found NUPN structural information;
[2022-05-20 22:01:45] [INFO ] Parsed PT model containing 3001 places and 2001 transitions in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 201 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-1000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Applied a total of 0 rules in 40 ms. Remains 3001 /3001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:01:45] [INFO ] Computed 1000 place invariants in 43 ms
[2022-05-20 22:01:46] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:01:46] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-20 22:01:46] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:01:47] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-20 22:01:48] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3001/3001 places, 2001/2001 transitions.
Support contains 3001 out of 3001 places after structural reductions.
[2022-05-20 22:01:49] [INFO ] Flatten gal took : 417 ms
[2022-05-20 22:01:49] [INFO ] Flatten gal took : 368 ms
[2022-05-20 22:01:50] [INFO ] Input system was already deterministic with 2001 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1804 ms. (steps per millisecond=5 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:01:52] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-20 22:01:53] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA Referendum-PT-1000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3001 transition count 2001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((F(X(p0))&&p0)))))'
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2001 transition count 2001
Applied a total of 1000 rules in 195 ms. Remains 2001 /3001 variables (removed 1000) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:01:53] [INFO ] Computed 0 place invariants in 15 ms
[2022-05-20 22:01:54] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:01:54] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:01:54] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:01:54] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-20 22:01:55] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2001/3001 places, 2001/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-1000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-01 finished in 2458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U p1) U X(p2))||X(p3)))))'
Support contains 2001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2001 transition count 2001
Applied a total of 1000 rules in 28 ms. Remains 2001 /3001 variables (removed 1000) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:01:56] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 22:01:56] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:01:56] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:01:56] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:01:56] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:01:58] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2001/3001 places, 2001/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(LEQ s0 (ADD s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 47180 steps with 11795 reset in 10002 ms.
Product exploration timeout after 49310 steps with 12327 reset in 10002 ms.
Computed a total of 2001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2001 transition count 2001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 415 ms. Reduced automaton from 11 states, 20 edges and 4 AP to 9 states, 15 edges and 4 AP.
Stuttering acceptance computed with spot in 345 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 3126 ms. (steps per millisecond=3 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1902 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1575 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1057 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:02:28] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 22:02:31] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 22:02:48] [INFO ] After 16737ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2001 out of 2001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 117 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2001 places, 2001/2001 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 2070 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1911 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Probabilistic random walk after 62352 steps, saw 62317 distinct states, run finished after 9021 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:01] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-20 22:03:02] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:03:16] [INFO ] After 13456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2001 out of 2001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 103 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2001 places, 2001/2001 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 73 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:16] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:03:16] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:16] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:03:17] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2022-05-20 22:03:17] [INFO ] Redundant transitions in 265 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:17] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:03:18] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 149 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:18] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:03:20] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:03:32] [INFO ] After 12627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p2), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 9 states, 15 edges and 4 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 336 ms :[(AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p3)), true]
Stuttering acceptance computed with spot in 315 ms :[(AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p3)), true]
Support contains 2001 out of 2001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 8 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:34] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:03:34] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:34] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:03:34] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:34] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:03:36] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2001 places, 2001/2001 transitions.
Computed a total of 2001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2001 transition count 2001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (X p1)), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1441 ms. (steps per millisecond=6 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1161 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:40] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 22:03:43] [INFO ] After 2605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:03:50] [INFO ] After 6426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:03:50] [INFO ] After 6631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-20 22:03:50] [INFO ] After 7196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 999 steps, including 0 resets, run visited all 1 properties in 232 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 234 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (X p1)), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p3) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2))))]
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:03:52] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 22:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:04:07] [INFO ] [Real]Absence check using state equation in 215 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Product exploration timeout after 63780 steps with 15945 reset in 10001 ms.
Product exploration timeout after 71690 steps with 17922 reset in 10001 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Support contains 2001 out of 2001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 31 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2022-05-20 22:04:28] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:04:28] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:04:29] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2001 places, 2001/2001 transitions.
Product exploration timeout after 66900 steps with 16725 reset in 10001 ms.
Product exploration timeout after 68220 steps with 17055 reset in 10002 ms.
Built C files in :
/tmp/ltsmin6583578478318041826
[2022-05-20 22:04:49] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6583578478318041826
Running compilation step : cd /tmp/ltsmin6583578478318041826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6583578478318041826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6583578478318041826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2001 out of 2001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2001/2001 places, 2001/2001 transitions.
Applied a total of 0 rules in 15 ms. Remains 2001 /2001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:04:52] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:04:53] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:04:53] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 22:04:54] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:04:54] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 22:04:56] [INFO ] Dead Transitions using invariants and state equation in 2385 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2001 places, 2001/2001 transitions.
Built C files in :
/tmp/ltsmin6122091455508572709
[2022-05-20 22:04:56] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6122091455508572709
Running compilation step : cd /tmp/ltsmin6122091455508572709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6122091455508572709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6122091455508572709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:05:00] [INFO ] Flatten gal took : 286 ms
[2022-05-20 22:05:00] [INFO ] Flatten gal took : 228 ms
[2022-05-20 22:05:00] [INFO ] Time to serialize gal into /tmp/LTL10022733933851394906.gal : 49 ms
[2022-05-20 22:05:00] [INFO ] Time to serialize properties into /tmp/LTL14522982166014634082.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10022733933851394906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14522982166014634082.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1002273...268
Read 1 LTL properties
Checking formula 0 : !((X(X(((("(ready<=((((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((vot...55650
Formula 0 simplified : !XX((("(ready<=((((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted...55639
Detected timeout of ITS tools.
[2022-05-20 22:05:16] [INFO ] Flatten gal took : 310 ms
[2022-05-20 22:05:16] [INFO ] Applying decomposition
[2022-05-20 22:05:16] [INFO ] Flatten gal took : 218 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12068584526378376610.txt' '-o' '/tmp/graph12068584526378376610.bin' '-w' '/tmp/graph12068584526378376610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12068584526378376610.bin' '-l' '-1' '-v' '-w' '/tmp/graph12068584526378376610.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:05:21] [INFO ] Decomposing Gal with order
[2022-05-20 22:05:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:05:24] [INFO ] Flatten gal took : 2716 ms
[2022-05-20 22:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2022-05-20 22:05:24] [INFO ] Time to serialize gal into /tmp/LTL11407542264112857141.gal : 32 ms
[2022-05-20 22:05:24] [INFO ] Time to serialize properties into /tmp/LTL8880159919576239341.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11407542264112857141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8880159919576239341.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1140754...267
Read 1 LTL properties
Checking formula 0 : !((X(X(((("(gu1.ready<=((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0...71658
Formula 0 simplified : !XX((("(gu1.ready<=((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0.v...71647
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8776328595892183522
[2022-05-20 22:05:39] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8776328595892183522
Running compilation step : cd /tmp/ltsmin8776328595892183522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8776328595892183522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8776328595892183522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Referendum-PT-1000-LTLCardinality-04 finished in 226514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 1001 are kept as prefixes of interest. Removing 2000 places using SCC suffix rule.11 ms
Discarding 2000 places :
Also discarding 0 output transitions
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 1001 transition count 1001
Applied a total of 1001 rules in 76 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:05:42] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:05:42] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:05:43] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 22:05:43] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2022-05-20 22:05:43] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1001 rows 1001 cols
[2022-05-20 22:05:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:05:44] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/3001 places, 1001/2001 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 8005 ms.
Product exploration explored 100000 steps with 50000 reset in 8342 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLCardinality-05 finished in 18749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(G(p0))&&F(p1)))))'
Support contains 2001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Applied a total of 0 rules in 284 ms. Remains 3001 /3001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:06:01] [INFO ] Computed 1000 place invariants in 30 ms
[2022-05-20 22:06:02] [INFO ] Implicit Places using invariants in 698 ms returned []
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:06:02] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-20 22:06:02] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2022-05-20 22:06:02] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 2001 rows 3001 cols
[2022-05-20 22:06:02] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-20 22:06:04] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s102...], 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 1001 steps with 0 reset in 121 ms.
FORMULA Referendum-PT-1000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-06 finished in 3093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(F(X(p0))))))))'
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 2001 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 2001 /3001 variables (removed 1000) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:06:04] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 22:06:04] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:06:04] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 22:06:05] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2022-05-20 22:06:05] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-20 22:06:05] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-20 22:06:06] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2001/3001 places, 2001/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-07 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:(LEQ (ADD s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 52750 steps with 78 reset in 10002 ms.
Product exploration timeout after 56140 steps with 83 reset in 10002 ms.
Computed a total of 2001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2001 transition count 2001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-1000-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLCardinality-07 finished in 23190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(G(p1))&&X(p2)&&p0))))'
Support contains 3 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1999 places and 0 transitions.
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 2998 rules applied. Total rules applied 2998 place count 1002 transition count 1002
Discarding 997 places :
Symmetric choice reduction at 1 with 997 rule applications. Total rules 3995 place count 5 transition count 5
Iterating global reduction 1 with 997 rules applied. Total rules applied 4992 place count 5 transition count 5
Applied a total of 4992 rules in 48 ms. Remains 5 /3001 variables (removed 2996) and now considering 5/2001 (removed 1996) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:27] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:06:27] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:27] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:06:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:27] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 22:06:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/3001 places, 5/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/3001 places, 5/2001 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s4 1)), p2:(AND (EQ s0 0) (EQ s4 1)), p1:(AND (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-1000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-09 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1998 places and 0 transitions.
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 0 with 2996 rules applied. Total rules applied 2996 place count 1003 transition count 1003
Discarding 996 places :
Symmetric choice reduction at 1 with 996 rule applications. Total rules 3992 place count 7 transition count 7
Iterating global reduction 1 with 996 rules applied. Total rules applied 4988 place count 7 transition count 7
Applied a total of 4988 rules in 30 ms. Remains 7 /3001 variables (removed 2994) and now considering 7/2001 (removed 1994) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:06:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:06:28] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:06:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:06:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:06:28] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 22:06:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/3001 places, 7/2001 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/3001 places, 7/2001 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (EQ s2 0) (EQ s6 1)), p0:(AND (EQ s0 0) (EQ s1 1) (OR (EQ s2 0) (EQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-1000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-13 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U p1) U X(p2))||X(p3)))))'
[2022-05-20 22:06:28] [INFO ] Flatten gal took : 170 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4457240781345246780
[2022-05-20 22:06:28] [INFO ] Too many transitions (2001) to apply POR reductions. Disabling POR matrices.
[2022-05-20 22:06:28] [INFO ] Applying decomposition
[2022-05-20 22:06:28] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4457240781345246780
Running compilation step : cd /tmp/ltsmin4457240781345246780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 22:06:28] [INFO ] Flatten gal took : 172 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17271711468662377053.txt' '-o' '/tmp/graph17271711468662377053.bin' '-w' '/tmp/graph17271711468662377053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17271711468662377053.bin' '-l' '-1' '-v' '-w' '/tmp/graph17271711468662377053.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:06:32] [INFO ] Decomposing Gal with order
[2022-05-20 22:06:32] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 5241 ms.
Running link step : cd /tmp/ltsmin4457240781345246780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4457240781345246780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((((LTLAPp0==true) U (LTLAPp1==true)) U X((LTLAPp2==true)))||X((LTLAPp3==true)))))' '--buchi-type=spotba'
[2022-05-20 22:06:35] [INFO ] Flatten gal took : 2314 ms
[2022-05-20 22:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2022-05-20 22:06:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality4019359134297385808.gal : 34 ms
[2022-05-20 22:06:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality15756571273757592177.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4019359134297385808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15756571273757592177.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(X(((("(gu1.ready<=((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0...71658
Formula 0 simplified : !XX((("(gu1.ready<=((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0.v...71647
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.07151e+301 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
14376 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,144.006,904348,1,0,10,2.57446e+06,47,5,101995,45992,23
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-1000-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 624202 ms.
BK_STOP 1653084729368
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="Referendum-PT-1000"
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-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-1000, 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 r186-tajo-165281572300451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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 '
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 ;