About the Execution of ITS-Tools for FamilyReunion-PT-L00020M0002C001P001G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14247.415 | 3600000.00 | 13963994.00 | 2388.90 | FFFFT?TFFTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110700723.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110700723
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 33K Apr 30 08:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 30 08:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 53K Apr 30 08:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 30 08:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:33 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 FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652719881892
Running Version 202205111006
[2022-05-16 16:51:23] [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-16 16:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:51:23] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2022-05-16 16:51:23] [INFO ] Transformed 3271 places.
[2022-05-16 16:51:23] [INFO ] Transformed 2753 transitions.
[2022-05-16 16:51:23] [INFO ] Parsed PT model containing 3271 places and 2753 transitions in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 505 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 570 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 49 places and 0 transitions.
Discarding 314 places :
Implicit places reduction removed 314 places
Iterating post reduction 0 with 363 rules applied. Total rules applied 363 place count 2897 transition count 2753
Discarding 186 places :
Symmetric choice reduction at 1 with 186 rule applications. Total rules 549 place count 2711 transition count 2547
Iterating global reduction 1 with 186 rules applied. Total rules applied 735 place count 2711 transition count 2547
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 756 place count 2690 transition count 2547
Applied a total of 756 rules in 836 ms. Remains 2690 /3260 variables (removed 570) and now considering 2547/2753 (removed 206) transitions.
// Phase 1: matrix 2547 rows 2690 cols
[2022-05-16 16:51:25] [INFO ] Computed 386 place invariants in 92 ms
[2022-05-16 16:51:26] [INFO ] Implicit Places using invariants in 1387 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1653, 1654, 1655, 1656, 1657, 1658, 1659, 1660, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2140, 2141, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2155, 2156, 2157, 2158, 2159, 2160, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542]
Discarding 168 places :
Implicit Place search using SMT only with invariants took 1450 ms to find 168 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2522/3260 places, 2547/2753 transitions.
Applied a total of 0 rules in 107 ms. Remains 2522 /2522 variables (removed 0) and now considering 2547/2547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2522/3260 places, 2547/2753 transitions.
Support contains 570 out of 2522 places after structural reductions.
[2022-05-16 16:51:26] [INFO ] Flatten gal took : 221 ms
[2022-05-16 16:51:26] [INFO ] Flatten gal took : 111 ms
[2022-05-16 16:51:27] [INFO ] Input system was already deterministic with 2547 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 27) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2547 rows 2522 cols
[2022-05-16 16:51:27] [INFO ] Computed 218 place invariants in 29 ms
[2022-05-16 16:51:28] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2022-05-16 16:51:28] [INFO ] [Real]Absence check using 39 positive and 179 generalized place invariants in 64 ms returned sat
[2022-05-16 16:51:28] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2022-05-16 16:51:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 49 ms returned sat
[2022-05-16 16:51:29] [INFO ] [Nat]Absence check using 39 positive and 179 generalized place invariants in 55 ms returned sat
[2022-05-16 16:51:30] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-05-16 16:51:31] [INFO ] After 1631ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-16 16:51:31] [INFO ] After 2650ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 532 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=53 )
Parikh walk visited 2 properties in 11 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2522 stabilizing places and 2547 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2522 transition count 2547
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' '!(X((G(F(!F(G(X(p0))))) U G((G(p1)||p1)))))'
Support contains 126 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 2431 transition count 2547
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 221 place count 2301 transition count 2396
Iterating global reduction 1 with 130 rules applied. Total rules applied 351 place count 2301 transition count 2396
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 372 place count 2301 transition count 2375
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 477 place count 2196 transition count 2250
Iterating global reduction 2 with 105 rules applied. Total rules applied 582 place count 2196 transition count 2250
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 666 place count 2112 transition count 2126
Iterating global reduction 2 with 84 rules applied. Total rules applied 750 place count 2112 transition count 2126
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 794 place count 2068 transition count 2022
Iterating global reduction 2 with 44 rules applied. Total rules applied 838 place count 2068 transition count 2022
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 859 place count 2068 transition count 2001
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 921 place count 2006 transition count 1939
Iterating global reduction 3 with 62 rules applied. Total rules applied 983 place count 2006 transition count 1939
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1045 place count 1944 transition count 1877
Iterating global reduction 3 with 62 rules applied. Total rules applied 1107 place count 1944 transition count 1877
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1169 place count 1882 transition count 1815
Iterating global reduction 3 with 62 rules applied. Total rules applied 1231 place count 1882 transition count 1815
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1232 place count 1881 transition count 1815
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1252 place count 1861 transition count 1795
Iterating global reduction 4 with 20 rules applied. Total rules applied 1272 place count 1861 transition count 1795
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1292 place count 1841 transition count 1775
Iterating global reduction 4 with 20 rules applied. Total rules applied 1312 place count 1841 transition count 1775
Applied a total of 1312 rules in 972 ms. Remains 1841 /2522 variables (removed 681) and now considering 1775/2547 (removed 772) transitions.
// Phase 1: matrix 1775 rows 1841 cols
[2022-05-16 16:51:32] [INFO ] Computed 130 place invariants in 15 ms
[2022-05-16 16:51:32] [INFO ] Implicit Places using invariants in 381 ms returned [399, 1037, 1651]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 384 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1838/2522 places, 1775/2547 transitions.
Applied a total of 0 rules in 93 ms. Remains 1838 /1838 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1838/2522 places, 1775/2547 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s886 s887 s888 s889 s890 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 379 reset in 521 ms.
Product exploration explored 100000 steps with 391 reset in 390 ms.
Computed a total of 1838 stabilizing places and 1775 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1838 transition count 1775
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) p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Finished random walk after 502 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (AND p1 p0)), (F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 471 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 1775 rows 1838 cols
[2022-05-16 16:51:35] [INFO ] Computed 127 place invariants in 21 ms
[2022-05-16 16:51:36] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 75 ms returned sat
[2022-05-16 16:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:51:38] [INFO ] [Real]Absence check using state equation in 1877 ms returned sat
[2022-05-16 16:51:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:51:39] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 66 ms returned sat
[2022-05-16 16:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:51:41] [INFO ] [Nat]Absence check using state equation in 1680 ms returned sat
[2022-05-16 16:51:41] [INFO ] Computed and/alt/rep : 1752/1942/1752 causal constraints (skipped 2 transitions) in 94 ms.
[2022-05-16 16:51:44] [INFO ] Added : 189 causal constraints over 38 iterations in 3389 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 1775 rows 1838 cols
[2022-05-16 16:51:44] [INFO ] Computed 127 place invariants in 15 ms
[2022-05-16 16:51:45] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 73 ms returned sat
[2022-05-16 16:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:51:46] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2022-05-16 16:51:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:51:47] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 83 ms returned sat
[2022-05-16 16:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:51:49] [INFO ] [Nat]Absence check using state equation in 1646 ms returned sat
[2022-05-16 16:51:49] [INFO ] Computed and/alt/rep : 1752/1942/1752 causal constraints (skipped 2 transitions) in 127 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 16:52:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Support contains 126 out of 1838 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1838/1838 places, 1775/1775 transitions.
Graph (complete) has 2069 edges and 1838 vertex of which 1638 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.9 ms
Discarding 200 places :
Also discarding 179 output transitions
Drop transitions removed 179 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 987 transitions
Trivial Post-agglo rules discarded 987 transitions
Performed 987 trivial Post agglomeration. Transition count delta: 987
Iterating post reduction 0 with 987 rules applied. Total rules applied 988 place count 1617 transition count 588
Reduce places removed 987 places and 0 transitions.
Iterating post reduction 1 with 987 rules applied. Total rules applied 1975 place count 630 transition count 588
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 210 Pre rules applied. Total rules applied 1975 place count 630 transition count 378
Deduced a syphon composed of 210 places in 0 ms
Ensure Unique test removed 84 places
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 2479 place count 336 transition count 378
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 2500 place count 315 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2500 place count 315 transition count 357
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2542 place count 294 transition count 357
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2584 place count 273 transition count 378
Applied a total of 2584 rules in 116 ms. Remains 273 /1838 variables (removed 1565) and now considering 378/1775 (removed 1397) transitions.
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:02] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:02] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-16 16:52:02] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:02] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 16:52:02] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/1838 places, 378/1775 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/1838 places, 378/1775 transitions.
Computed a total of 273 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 273 transition count 378
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) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 471 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Finished random walk after 29 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 p0)), (F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 757 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:52:04] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-16 16:52:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:52:04] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-16 16:52:04] [INFO ] Computed and/alt/rep : 315/420/315 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 16:52:04] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:52:04] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-16 16:52:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:52:05] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 16:52:05] [INFO ] Computed and/alt/rep : 315/420/315 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 16:52:05] [INFO ] Added : 42 causal constraints over 9 iterations in 194 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 5803 reset in 380 ms.
Product exploration explored 100000 steps with 5738 reset in 398 ms.
Built C files in :
/tmp/ltsmin4437807732679957402
[2022-05-16 16:52:06] [INFO ] Computing symmetric may disable matrix : 378 transitions.
[2022-05-16 16:52:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:52:06] [INFO ] Computing symmetric may enable matrix : 378 transitions.
[2022-05-16 16:52:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:52:06] [INFO ] Computing Do-Not-Accords matrix : 378 transitions.
[2022-05-16 16:52:06] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:52:06] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4437807732679957402
Running compilation step : cd /tmp/ltsmin4437807732679957402;'/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'
Compilation finished in 1538 ms.
Running link step : cd /tmp/ltsmin4437807732679957402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4437807732679957402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7454450890210852341.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 126 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 378/378 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 378/378 (removed 0) transitions.
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:21] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:21] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-16 16:52:21] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:52:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:52:21] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 378/378 transitions.
Built C files in :
/tmp/ltsmin2012566825889843398
[2022-05-16 16:52:21] [INFO ] Computing symmetric may disable matrix : 378 transitions.
[2022-05-16 16:52:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:52:21] [INFO ] Computing symmetric may enable matrix : 378 transitions.
[2022-05-16 16:52:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:52:21] [INFO ] Computing Do-Not-Accords matrix : 378 transitions.
[2022-05-16 16:52:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:52:21] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2012566825889843398
Running compilation step : cd /tmp/ltsmin2012566825889843398;'/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'
Compilation finished in 623 ms.
Running link step : cd /tmp/ltsmin2012566825889843398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2012566825889843398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9099498009681761475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:52:36] [INFO ] Flatten gal took : 11 ms
[2022-05-16 16:52:36] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:52:36] [INFO ] Time to serialize gal into /tmp/LTL15552270437805523464.gal : 3 ms
[2022-05-16 16:52:36] [INFO ] Time to serialize properties into /tmp/LTL6671369586132875593.ltl : 1 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/LTL15552270437805523464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6671369586132875593.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/LTL1555227...267
Read 1 LTL properties
Checking formula 0 : !((X((G(F(!(F(G(X("(((((((p9_0_0+p9_1_0)+(p9_2_0+p9_3_0))+((p9_4_0+p9_5_0)+(p9_6_0+p9_7_0)))+(((p9_8_0+p9_9_0)+(p9_10_0+p9_11_0))+((p9...1977
Formula 0 simplified : !X(GF!FGX"(((((((p9_0_0+p9_1_0)+(p9_2_0+p9_3_0))+((p9_4_0+p9_5_0)+(p9_6_0+p9_7_0)))+(((p9_8_0+p9_9_0)+(p9_10_0+p9_11_0))+((p9_12_0+p...1956
Reverse transition relation is NOT exact ! Due to transitions t2526.t2505.t2484.t0, t2527.t2506.t2485.t1, t2528.t2507.t2486.t2, t2529.t2508.t2487.t3, t2530...635
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 16:52:51] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:52:51] [INFO ] Applying decomposition
[2022-05-16 16:52:52] [INFO ] Flatten gal took : 9 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/graph15533088391315753288.txt' '-o' '/tmp/graph15533088391315753288.bin' '-w' '/tmp/graph15533088391315753288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15533088391315753288.bin' '-l' '-1' '-v' '-w' '/tmp/graph15533088391315753288.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:52:52] [INFO ] Decomposing Gal with order
[2022-05-16 16:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:52:52] [INFO ] Flatten gal took : 74 ms
[2022-05-16 16:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 16:52:52] [INFO ] Time to serialize gal into /tmp/LTL9977214189849254882.gal : 2 ms
[2022-05-16 16:52:52] [INFO ] Time to serialize properties into /tmp/LTL15874371273971749709.ltl : 1 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/LTL9977214189849254882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15874371273971749709.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/LTL9977214...267
Read 1 LTL properties
Checking formula 0 : !((X((G(F(!(F(G(X("(((((((gu0.p9_0_0+gu0.p9_1_0)+(gu0.p9_2_0+gu0.p9_3_0))+((gu0.p9_4_0+gu0.p9_5_0)+(gu0.p9_6_0+gu0.p9_7_0)))+(((gu0.p9...2859
Formula 0 simplified : !X(GF!FGX"(((((((gu0.p9_0_0+gu0.p9_1_0)+(gu0.p9_2_0+gu0.p9_3_0))+((gu0.p9_4_0+gu0.p9_5_0)+(gu0.p9_6_0+gu0.p9_7_0)))+(((gu0.p9_8_0+gu...2838
Reverse transition relation is NOT exact ! Due to transitions gu0.t2526.t2505.t2484.t0, gu0.t2527.t2506.t2485.t1, gu0.t2528.t2507.t2486.t2, gu0.t2529.t2508...719
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3182912560987492492
[2022-05-16 16:53:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3182912560987492492
Running compilation step : cd /tmp/ltsmin3182912560987492492;'/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'
Compilation finished in 462 ms.
Running link step : cd /tmp/ltsmin3182912560987492492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3182912560987492492;'/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))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 finished in 110791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U X(p1)))'
Support contains 42 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 2431 transition count 2547
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 221 place count 2301 transition count 2396
Iterating global reduction 1 with 130 rules applied. Total rules applied 351 place count 2301 transition count 2396
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 372 place count 2301 transition count 2375
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 498 place count 2175 transition count 2229
Iterating global reduction 2 with 126 rules applied. Total rules applied 624 place count 2175 transition count 2229
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 729 place count 2070 transition count 2084
Iterating global reduction 2 with 105 rules applied. Total rules applied 834 place count 2070 transition count 2084
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 878 place count 2026 transition count 1980
Iterating global reduction 2 with 44 rules applied. Total rules applied 922 place count 2026 transition count 1980
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 943 place count 2026 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1005 place count 1964 transition count 1897
Iterating global reduction 3 with 62 rules applied. Total rules applied 1067 place count 1964 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1129 place count 1902 transition count 1835
Iterating global reduction 3 with 62 rules applied. Total rules applied 1191 place count 1902 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1253 place count 1840 transition count 1773
Iterating global reduction 3 with 62 rules applied. Total rules applied 1315 place count 1840 transition count 1773
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1316 place count 1839 transition count 1773
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1378 place count 1777 transition count 1711
Iterating global reduction 4 with 62 rules applied. Total rules applied 1440 place count 1777 transition count 1711
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1502 place count 1715 transition count 1649
Iterating global reduction 4 with 62 rules applied. Total rules applied 1564 place count 1715 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1606 place count 1673 transition count 1607
Iterating global reduction 4 with 42 rules applied. Total rules applied 1648 place count 1673 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1690 place count 1631 transition count 1565
Iterating global reduction 4 with 42 rules applied. Total rules applied 1732 place count 1631 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1774 place count 1589 transition count 1523
Iterating global reduction 4 with 42 rules applied. Total rules applied 1816 place count 1589 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1858 place count 1547 transition count 1481
Iterating global reduction 4 with 42 rules applied. Total rules applied 1900 place count 1547 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1942 place count 1505 transition count 1439
Iterating global reduction 4 with 42 rules applied. Total rules applied 1984 place count 1505 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2026 place count 1463 transition count 1397
Iterating global reduction 4 with 42 rules applied. Total rules applied 2068 place count 1463 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2110 place count 1421 transition count 1355
Iterating global reduction 4 with 42 rules applied. Total rules applied 2152 place count 1421 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2194 place count 1379 transition count 1313
Iterating global reduction 4 with 42 rules applied. Total rules applied 2236 place count 1379 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 2278 place count 1379 transition count 1271
Applied a total of 2278 rules in 1712 ms. Remains 1379 /2522 variables (removed 1143) and now considering 1271/2547 (removed 1276) transitions.
// Phase 1: matrix 1271 rows 1379 cols
[2022-05-16 16:53:24] [INFO ] Computed 130 place invariants in 13 ms
[2022-05-16 16:53:24] [INFO ] Implicit Places using invariants in 306 ms returned [273, 617, 1189]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 307 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2522 places, 1271/2547 transitions.
Applied a total of 0 rules in 56 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1376/2522 places, 1271/2547 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s977 s978 s979 s980 s981 s982 s983 s984 s985 s986 s987 s988 s989 s990 s991 s992 s993 s994 s995 s996 s997 s998 s999 s1000 s1001 s1002 s1003 ...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 423 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01 finished in 2245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 42 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 2431 transition count 2547
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 221 place count 2301 transition count 2396
Iterating global reduction 1 with 130 rules applied. Total rules applied 351 place count 2301 transition count 2396
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 372 place count 2301 transition count 2375
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 498 place count 2175 transition count 2229
Iterating global reduction 2 with 126 rules applied. Total rules applied 624 place count 2175 transition count 2229
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 729 place count 2070 transition count 2084
Iterating global reduction 2 with 105 rules applied. Total rules applied 834 place count 2070 transition count 2084
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 878 place count 2026 transition count 1980
Iterating global reduction 2 with 44 rules applied. Total rules applied 922 place count 2026 transition count 1980
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 943 place count 2026 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1005 place count 1964 transition count 1897
Iterating global reduction 3 with 62 rules applied. Total rules applied 1067 place count 1964 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1129 place count 1902 transition count 1835
Iterating global reduction 3 with 62 rules applied. Total rules applied 1191 place count 1902 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1253 place count 1840 transition count 1773
Iterating global reduction 3 with 62 rules applied. Total rules applied 1315 place count 1840 transition count 1773
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1316 place count 1839 transition count 1773
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1378 place count 1777 transition count 1711
Iterating global reduction 4 with 62 rules applied. Total rules applied 1440 place count 1777 transition count 1711
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1502 place count 1715 transition count 1649
Iterating global reduction 4 with 62 rules applied. Total rules applied 1564 place count 1715 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1606 place count 1673 transition count 1607
Iterating global reduction 4 with 42 rules applied. Total rules applied 1648 place count 1673 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1690 place count 1631 transition count 1565
Iterating global reduction 4 with 42 rules applied. Total rules applied 1732 place count 1631 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1774 place count 1589 transition count 1523
Iterating global reduction 4 with 42 rules applied. Total rules applied 1816 place count 1589 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1858 place count 1547 transition count 1481
Iterating global reduction 4 with 42 rules applied. Total rules applied 1900 place count 1547 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1942 place count 1505 transition count 1439
Iterating global reduction 4 with 42 rules applied. Total rules applied 1984 place count 1505 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2026 place count 1463 transition count 1397
Iterating global reduction 4 with 42 rules applied. Total rules applied 2068 place count 1463 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2110 place count 1421 transition count 1355
Iterating global reduction 4 with 42 rules applied. Total rules applied 2152 place count 1421 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2194 place count 1379 transition count 1313
Iterating global reduction 4 with 42 rules applied. Total rules applied 2236 place count 1379 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 2278 place count 1379 transition count 1271
Applied a total of 2278 rules in 1685 ms. Remains 1379 /2522 variables (removed 1143) and now considering 1271/2547 (removed 1276) transitions.
// Phase 1: matrix 1271 rows 1379 cols
[2022-05-16 16:53:26] [INFO ] Computed 130 place invariants in 15 ms
[2022-05-16 16:53:26] [INFO ] Implicit Places using invariants in 277 ms returned [273, 617, 1189]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 278 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2522 places, 1271/2547 transitions.
Applied a total of 0 rules in 57 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1376/2522 places, 1271/2547 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-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:(LEQ 2 (ADD s1061 s1062 s1063 s1064 s1065 s1066 s1067 s1068 s1069 s1070 s1071 s1072 s1073 s1074 s1075 s1076 s1077 s1078 s1079 s1080 s1081 s1082 s1083 s...], 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]]
Product exploration explored 100000 steps with 182 reset in 296 ms.
Product exploration explored 100000 steps with 179 reset in 300 ms.
Computed a total of 1376 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 422 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 591 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=147 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 1271 rows 1376 cols
[2022-05-16 16:53:28] [INFO ] Computed 127 place invariants in 7 ms
[2022-05-16 16:53:28] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 60 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-02 finished in 4339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&p1) U X(G(!p1))))'
Support contains 65 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 2433 transition count 2547
Discarding 109 places :
Symmetric choice reduction at 1 with 109 rule applications. Total rules 198 place count 2324 transition count 2417
Iterating global reduction 1 with 109 rules applied. Total rules applied 307 place count 2324 transition count 2417
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 433 place count 2198 transition count 2271
Iterating global reduction 1 with 126 rules applied. Total rules applied 559 place count 2198 transition count 2271
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 664 place count 2093 transition count 2126
Iterating global reduction 1 with 105 rules applied. Total rules applied 769 place count 2093 transition count 2126
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 813 place count 2049 transition count 2022
Iterating global reduction 1 with 44 rules applied. Total rules applied 857 place count 2049 transition count 2022
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 878 place count 2049 transition count 2001
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 940 place count 1987 transition count 1939
Iterating global reduction 2 with 62 rules applied. Total rules applied 1002 place count 1987 transition count 1939
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1064 place count 1925 transition count 1877
Iterating global reduction 2 with 62 rules applied. Total rules applied 1126 place count 1925 transition count 1877
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1188 place count 1863 transition count 1815
Iterating global reduction 2 with 62 rules applied. Total rules applied 1250 place count 1863 transition count 1815
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 1251 place count 1862 transition count 1815
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1313 place count 1800 transition count 1753
Iterating global reduction 3 with 62 rules applied. Total rules applied 1375 place count 1800 transition count 1753
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1437 place count 1738 transition count 1691
Iterating global reduction 3 with 62 rules applied. Total rules applied 1499 place count 1738 transition count 1691
Applied a total of 1499 rules in 1125 ms. Remains 1738 /2522 variables (removed 784) and now considering 1691/2547 (removed 856) transitions.
// Phase 1: matrix 1691 rows 1738 cols
[2022-05-16 16:53:30] [INFO ] Computed 131 place invariants in 12 ms
[2022-05-16 16:53:30] [INFO ] Implicit Places using invariants in 332 ms returned [399, 953, 1548]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 334 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1735/2522 places, 1691/2547 transitions.
Applied a total of 0 rules in 85 ms. Remains 1735 /1735 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1735/2522 places, 1691/2547 transitions.
Stuttering acceptance computed with spot in 96 ms :[p1, true, p1, p1]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT (ADD s1208 s1209) (ADD s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 323 steps with 0 reset in 5 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03 finished in 1675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F(X(p0))))))'
Support contains 84 out of 2522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Graph (complete) has 3474 edges and 2522 vertex of which 2514 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Drop transitions removed 1445 transitions
Trivial Post-agglo rules discarded 1445 transitions
Performed 1445 trivial Post agglomeration. Transition count delta: 1445
Iterating post reduction 0 with 1509 rules applied. Total rules applied 1510 place count 2429 transition count 1079
Reduce places removed 1445 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 1508 rules applied. Total rules applied 3018 place count 984 transition count 1016
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 3060 place count 942 transition count 1016
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 296 Pre rules applied. Total rules applied 3060 place count 942 transition count 720
Deduced a syphon composed of 296 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 697 rules applied. Total rules applied 3757 place count 541 transition count 720
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3799 place count 541 transition count 678
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3841 place count 499 transition count 678
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3841 place count 499 transition count 657
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3883 place count 478 transition count 657
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 3929 place count 432 transition count 590
Iterating global reduction 5 with 46 rules applied. Total rules applied 3975 place count 432 transition count 590
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 4017 place count 432 transition count 548
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 44 Pre rules applied. Total rules applied 4017 place count 432 transition count 504
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 4105 place count 388 transition count 504
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4107 place count 386 transition count 462
Iterating global reduction 6 with 2 rules applied. Total rules applied 4109 place count 386 transition count 462
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 6 with 42 rules applied. Total rules applied 4151 place count 386 transition count 420
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4172 place count 365 transition count 420
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4173 place count 364 transition count 399
Iterating global reduction 8 with 1 rules applied. Total rules applied 4174 place count 364 transition count 399
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 4258 place count 322 transition count 357
Applied a total of 4258 rules in 110 ms. Remains 322 /2522 variables (removed 2200) and now considering 357/2547 (removed 2190) transitions.
// Phase 1: matrix 357 rows 322 cols
[2022-05-16 16:53:30] [INFO ] Computed 47 place invariants in 2 ms
[2022-05-16 16:53:30] [INFO ] Implicit Places using invariants in 116 ms returned [21, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 107, 300]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 117 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/2522 places, 357/2547 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 298 transition count 315
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 256 transition count 315
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 84 place count 256 transition count 294
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 126 place count 235 transition count 294
Applied a total of 126 rules in 12 ms. Remains 235 /298 variables (removed 63) and now considering 294/357 (removed 63) transitions.
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:30] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 16:53:30] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:30] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 16:53:31] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 235/2522 places, 294/2547 transitions.
Finished structural reductions, in 2 iterations. Remains : 235/2522 places, 294/2547 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-05 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:(GT (ADD s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87) (ADD s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1179 reset in 441 ms.
Product exploration explored 100000 steps with 1174 reset in 449 ms.
Computed a total of 235 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 294
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 435 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:32] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 16:53:33] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-16 16:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:33] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-16 16:53:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-16 16:53:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:33] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-05-16 16:53:33] [INFO ] Computed and/alt/rep : 168/210/168 causal constraints (skipped 63 transitions) in 17 ms.
[2022-05-16 16:53:33] [INFO ] Added : 46 causal constraints over 10 iterations in 202 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 84 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:33] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-16 16:53:33] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:33] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 16:53:33] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-05-16 16:53:33] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:33] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 16:53:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 294/294 transitions.
Computed a total of 235 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 294
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:34] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 16:53:34] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-16 16:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:34] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-16 16:53:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-16 16:53:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:35] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-05-16 16:53:35] [INFO ] Computed and/alt/rep : 168/210/168 causal constraints (skipped 63 transitions) in 16 ms.
[2022-05-16 16:53:35] [INFO ] Added : 46 causal constraints over 10 iterations in 192 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1173 reset in 441 ms.
Product exploration explored 100000 steps with 1174 reset in 449 ms.
Built C files in :
/tmp/ltsmin3770344766071866876
[2022-05-16 16:53:36] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2022-05-16 16:53:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:53:36] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2022-05-16 16:53:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:53:36] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2022-05-16 16:53:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:53:36] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3770344766071866876
Running compilation step : cd /tmp/ltsmin3770344766071866876;'/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'
Compilation finished in 543 ms.
Running link step : cd /tmp/ltsmin3770344766071866876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3770344766071866876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9023902120849276424.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 84 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 235 /235 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:51] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-16 16:53:51] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:51] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 16:53:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-05-16 16:53:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 16:53:51] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 16:53:51] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 294/294 transitions.
Built C files in :
/tmp/ltsmin9806241562912553539
[2022-05-16 16:53:51] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2022-05-16 16:53:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:53:51] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2022-05-16 16:53:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:53:51] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2022-05-16 16:53:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:53:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9806241562912553539
Running compilation step : cd /tmp/ltsmin9806241562912553539;'/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'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin9806241562912553539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9806241562912553539;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8169447116201305566.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:54:07] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:54:07] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:54:07] [INFO ] Time to serialize gal into /tmp/LTL280729481860648463.gal : 52 ms
[2022-05-16 16:54:07] [INFO ] Time to serialize properties into /tmp/LTL4278757914873460586.ltl : 1 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/LTL280729481860648463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4278757914873460586.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/LTL2807294...265
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_...882
Formula 0 simplified : !XGFX"((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38...869
Detected timeout of ITS tools.
[2022-05-16 16:54:22] [INFO ] Flatten gal took : 14 ms
[2022-05-16 16:54:22] [INFO ] Applying decomposition
[2022-05-16 16:54:22] [INFO ] Flatten gal took : 8 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/graph3651900581384292453.txt' '-o' '/tmp/graph3651900581384292453.bin' '-w' '/tmp/graph3651900581384292453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3651900581384292453.bin' '-l' '-1' '-v' '-w' '/tmp/graph3651900581384292453.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:54:22] [INFO ] Decomposing Gal with order
[2022-05-16 16:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:54:22] [INFO ] Removed a total of 213 redundant transitions.
[2022-05-16 16:54:22] [INFO ] Flatten gal took : 79 ms
[2022-05-16 16:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 10 ms.
[2022-05-16 16:54:22] [INFO ] Time to serialize gal into /tmp/LTL6379023613071114872.gal : 4 ms
[2022-05-16 16:54:22] [INFO ] Time to serialize properties into /tmp/LTL15559697643398684517.ltl : 1 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/LTL6379023613071114872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15559697643398684517.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/LTL6379023...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((gu22.l38_0+gu22.l38_1)+(gu22.l38_2+gu22.l38_3))+((gu22.l38_4+gu22.l38_5)+(gu22.l38_6+gu22.l38_7)))+(((gu22.l38_8+g...1302
Formula 0 simplified : !XGFX"((((((gu22.l38_0+gu22.l38_1)+(gu22.l38_2+gu22.l38_3))+((gu22.l38_4+gu22.l38_5)+(gu22.l38_6+gu22.l38_7)))+(((gu22.l38_8+gu22.l3...1289
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17847947981101276236
[2022-05-16 16:54:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17847947981101276236
Running compilation step : cd /tmp/ltsmin17847947981101276236;'/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'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin17847947981101276236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17847947981101276236;'/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))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-05 finished in 81869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||p2)))'
Support contains 150 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 2431 transition count 2547
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 221 place count 2301 transition count 2396
Iterating global reduction 1 with 130 rules applied. Total rules applied 351 place count 2301 transition count 2396
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 372 place count 2301 transition count 2375
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 498 place count 2175 transition count 2229
Iterating global reduction 2 with 126 rules applied. Total rules applied 624 place count 2175 transition count 2229
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 729 place count 2070 transition count 2084
Iterating global reduction 2 with 105 rules applied. Total rules applied 834 place count 2070 transition count 2084
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 876 place count 2028 transition count 2022
Iterating global reduction 2 with 42 rules applied. Total rules applied 918 place count 2028 transition count 2022
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 939 place count 2028 transition count 2001
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 959 place count 2008 transition count 1981
Iterating global reduction 3 with 20 rules applied. Total rules applied 979 place count 2008 transition count 1981
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 999 place count 1988 transition count 1961
Iterating global reduction 3 with 20 rules applied. Total rules applied 1019 place count 1988 transition count 1961
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1039 place count 1968 transition count 1941
Iterating global reduction 3 with 20 rules applied. Total rules applied 1059 place count 1968 transition count 1941
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1060 place count 1967 transition count 1941
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1080 place count 1947 transition count 1921
Iterating global reduction 4 with 20 rules applied. Total rules applied 1100 place count 1947 transition count 1921
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1120 place count 1927 transition count 1901
Iterating global reduction 4 with 20 rules applied. Total rules applied 1140 place count 1927 transition count 1901
Applied a total of 1140 rules in 1101 ms. Remains 1927 /2522 variables (removed 595) and now considering 1901/2547 (removed 646) transitions.
// Phase 1: matrix 1901 rows 1927 cols
[2022-05-16 16:54:53] [INFO ] Computed 130 place invariants in 17 ms
[2022-05-16 16:54:54] [INFO ] Implicit Places using invariants in 383 ms returned [399, 1737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1925/2522 places, 1901/2547 transitions.
Applied a total of 0 rules in 103 ms. Remains 1925 /1925 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1925/2522 places, 1901/2547 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LEQ (ADD s1231 s1232 s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251) (ADD s142...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1009 ms.
Product exploration explored 100000 steps with 50000 reset in 1032 ms.
Computed a total of 1925 stabilizing places and 1901 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1925 transition count 1901
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) p0 p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-06 finished in 4326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(p0) U p1))))'
Support contains 105 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 2494 transition count 2547
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 158 place count 2364 transition count 2396
Iterating global reduction 1 with 130 rules applied. Total rules applied 288 place count 2364 transition count 2396
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 309 place count 2364 transition count 2375
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 435 place count 2238 transition count 2229
Iterating global reduction 2 with 126 rules applied. Total rules applied 561 place count 2238 transition count 2229
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 666 place count 2133 transition count 2084
Iterating global reduction 2 with 105 rules applied. Total rules applied 771 place count 2133 transition count 2084
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 815 place count 2089 transition count 1980
Iterating global reduction 2 with 44 rules applied. Total rules applied 859 place count 2089 transition count 1980
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 880 place count 2089 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 942 place count 2027 transition count 1897
Iterating global reduction 3 with 62 rules applied. Total rules applied 1004 place count 2027 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1066 place count 1965 transition count 1835
Iterating global reduction 3 with 62 rules applied. Total rules applied 1128 place count 1965 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1190 place count 1903 transition count 1773
Iterating global reduction 3 with 62 rules applied. Total rules applied 1252 place count 1903 transition count 1773
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 1253 place count 1902 transition count 1773
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1273 place count 1882 transition count 1753
Iterating global reduction 4 with 20 rules applied. Total rules applied 1293 place count 1882 transition count 1753
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1313 place count 1862 transition count 1733
Iterating global reduction 4 with 20 rules applied. Total rules applied 1333 place count 1862 transition count 1733
Applied a total of 1333 rules in 1165 ms. Remains 1862 /2522 variables (removed 660) and now considering 1733/2547 (removed 814) transitions.
// Phase 1: matrix 1733 rows 1862 cols
[2022-05-16 16:54:58] [INFO ] Computed 193 place invariants in 17 ms
[2022-05-16 16:54:58] [INFO ] Implicit Places using invariants in 400 ms returned [399, 1100, 1672]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 401 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1859/2522 places, 1733/2547 transitions.
Applied a total of 0 rules in 100 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1859/2522 places, 1733/2547 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1355 s1356 s1357 s1358 s1359 s1360 s1361 s1362 s1363 s1364 s1365 s1366 s1367 s1368 s1369 s1370 s1371 s1372 s1373 s1374 s1375) (ADD s63 s64 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 11 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07 finished in 1810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 1 out of 2522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Graph (complete) has 3474 edges and 2522 vertex of which 2393 are kept as prefixes of interest. Removing 129 places using SCC suffix rule.3 ms
Discarding 129 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Drop transitions removed 1533 transitions
Trivial Post-agglo rules discarded 1533 transitions
Performed 1533 trivial Post agglomeration. Transition count delta: 1533
Iterating post reduction 0 with 1597 rules applied. Total rules applied 1598 place count 2308 transition count 869
Reduce places removed 1533 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 1596 rules applied. Total rules applied 3194 place count 775 transition count 806
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 3236 place count 733 transition count 806
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 3236 place count 733 transition count 512
Deduced a syphon composed of 294 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 693 rules applied. Total rules applied 3929 place count 334 transition count 512
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3971 place count 334 transition count 470
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 4013 place count 292 transition count 470
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 4013 place count 292 transition count 449
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 4055 place count 271 transition count 449
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 4101 place count 225 transition count 323
Iterating global reduction 5 with 46 rules applied. Total rules applied 4147 place count 225 transition count 323
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 86 rules applied. Total rules applied 4233 place count 225 transition count 237
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 4255 place count 203 transition count 237
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 4255 place count 203 transition count 214
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 4301 place count 180 transition count 214
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4304 place count 177 transition count 171
Iterating global reduction 7 with 3 rules applied. Total rules applied 4307 place count 177 transition count 171
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 7 with 42 rules applied. Total rules applied 4349 place count 177 transition count 129
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 4370 place count 156 transition count 129
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 4412 place count 135 transition count 108
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 9 with 21 rules applied. Total rules applied 4433 place count 114 transition count 87
Applied a total of 4433 rules in 59 ms. Remains 114 /2522 variables (removed 2408) and now considering 87/2547 (removed 2460) transitions.
// Phase 1: matrix 87 rows 114 cols
[2022-05-16 16:54:58] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-16 16:54:58] [INFO ] Implicit Places using invariants in 78 ms returned [0, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 67, 89, 92]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 86 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/2522 places, 87/2547 transitions.
Graph (complete) has 88 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 67 transition count 43
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 45 transition count 43
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 45 place count 45 transition count 22
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 87 place count 24 transition count 22
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 106 place count 5 transition count 3
Iterating global reduction 2 with 19 rules applied. Total rules applied 125 place count 5 transition count 3
Applied a total of 125 rules in 4 ms. Remains 5 /89 variables (removed 84) and now considering 3/87 (removed 84) transitions.
// Phase 1: matrix 3 rows 5 cols
[2022-05-16 16:54:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:54:58] [INFO ] Implicit Places using invariants in 14 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/2522 places, 3/2547 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4/2522 places, 3/2547 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08 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 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U !F(!X(p1))))'
Support contains 3 out of 2522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Reduce places removed 27 places and 0 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 2431 transition count 2547
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 218 place count 2304 transition count 2419
Iterating global reduction 1 with 127 rules applied. Total rules applied 345 place count 2304 transition count 2419
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 366 place count 2304 transition count 2398
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 471 place count 2199 transition count 2273
Iterating global reduction 2 with 105 rules applied. Total rules applied 576 place count 2199 transition count 2273
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 659 place count 2116 transition count 2150
Iterating global reduction 2 with 83 rules applied. Total rules applied 742 place count 2116 transition count 2150
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 785 place count 2073 transition count 2067
Iterating global reduction 2 with 43 rules applied. Total rules applied 828 place count 2073 transition count 2067
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 849 place count 2073 transition count 2046
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 911 place count 2011 transition count 1984
Iterating global reduction 3 with 62 rules applied. Total rules applied 973 place count 2011 transition count 1984
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1035 place count 1949 transition count 1922
Iterating global reduction 3 with 62 rules applied. Total rules applied 1097 place count 1949 transition count 1922
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1159 place count 1887 transition count 1860
Iterating global reduction 3 with 62 rules applied. Total rules applied 1221 place count 1887 transition count 1860
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1282 place count 1826 transition count 1780
Iterating global reduction 3 with 61 rules applied. Total rules applied 1343 place count 1826 transition count 1780
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1404 place count 1765 transition count 1719
Iterating global reduction 3 with 61 rules applied. Total rules applied 1465 place count 1765 transition count 1719
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1507 place count 1723 transition count 1677
Iterating global reduction 3 with 42 rules applied. Total rules applied 1549 place count 1723 transition count 1677
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1591 place count 1681 transition count 1635
Iterating global reduction 3 with 42 rules applied. Total rules applied 1633 place count 1681 transition count 1635
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1675 place count 1639 transition count 1593
Iterating global reduction 3 with 42 rules applied. Total rules applied 1717 place count 1639 transition count 1593
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1759 place count 1597 transition count 1551
Iterating global reduction 3 with 42 rules applied. Total rules applied 1801 place count 1597 transition count 1551
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1843 place count 1555 transition count 1509
Iterating global reduction 3 with 42 rules applied. Total rules applied 1885 place count 1555 transition count 1509
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1927 place count 1513 transition count 1467
Iterating global reduction 3 with 42 rules applied. Total rules applied 1969 place count 1513 transition count 1467
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2011 place count 1471 transition count 1425
Iterating global reduction 3 with 42 rules applied. Total rules applied 2053 place count 1471 transition count 1425
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2095 place count 1429 transition count 1383
Iterating global reduction 3 with 42 rules applied. Total rules applied 2137 place count 1429 transition count 1383
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 2179 place count 1429 transition count 1341
Applied a total of 2179 rules in 1592 ms. Remains 1429 /2522 variables (removed 1093) and now considering 1341/2547 (removed 1206) transitions.
// Phase 1: matrix 1341 rows 1429 cols
[2022-05-16 16:55:00] [INFO ] Computed 131 place invariants in 12 ms
[2022-05-16 16:55:00] [INFO ] Implicit Places using invariants in 304 ms returned [273, 558, 623]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 305 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1426/2522 places, 1341/2547 transitions.
Applied a total of 0 rules in 62 ms. Remains 1426 /1426 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1426/2522 places, 1341/2547 transitions.
Stuttering acceptance computed with spot in 89 ms :[p1, p1]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1192), p1:(LEQ s1236 s442)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 173 reset in 263 ms.
Product exploration explored 100000 steps with 171 reset in 265 ms.
Computed a total of 1426 stabilizing places and 1341 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1426 transition count 1341
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 p0) p1), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
Finished random walk after 508 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 318 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p1]
Stuttering acceptance computed with spot in 33 ms :[p1]
// Phase 1: matrix 1341 rows 1426 cols
[2022-05-16 16:55:02] [INFO ] Computed 128 place invariants in 10 ms
[2022-05-16 16:55:03] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 48 ms returned sat
[2022-05-16 16:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:04] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2022-05-16 16:55:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:55:04] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 50 ms returned sat
[2022-05-16 16:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:05] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2022-05-16 16:55:05] [INFO ] Computed and/alt/rep : 1275/1447/1275 causal constraints (skipped 45 transitions) in 64 ms.
[2022-05-16 16:55:16] [INFO ] Added : 735 causal constraints over 147 iterations in 11016 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 1426 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1426/1426 places, 1341/1341 transitions.
Graph (complete) has 1698 edges and 1426 vertex of which 1418 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 799 transitions
Trivial Post-agglo rules discarded 799 transitions
Performed 799 trivial Post agglomeration. Transition count delta: 799
Iterating post reduction 0 with 799 rules applied. Total rules applied 800 place count 1397 transition count 512
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 1 with 799 rules applied. Total rules applied 1599 place count 598 transition count 512
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 296 Pre rules applied. Total rules applied 1599 place count 598 transition count 216
Deduced a syphon composed of 296 places in 0 ms
Ensure Unique test removed 126 places
Reduce places removed 422 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2317 place count 176 transition count 216
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 41 rules applied. Total rules applied 2358 place count 176 transition count 175
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 2399 place count 135 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2399 place count 135 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2401 place count 134 transition count 174
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2420 place count 115 transition count 155
Iterating global reduction 4 with 19 rules applied. Total rules applied 2439 place count 115 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2439 place count 115 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2441 place count 114 transition count 154
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2460 place count 95 transition count 116
Iterating global reduction 4 with 19 rules applied. Total rules applied 2479 place count 95 transition count 116
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 2517 place count 57 transition count 78
Iterating global reduction 4 with 38 rules applied. Total rules applied 2555 place count 57 transition count 78
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2574 place count 38 transition count 59
Iterating global reduction 4 with 19 rules applied. Total rules applied 2593 place count 38 transition count 59
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2612 place count 19 transition count 21
Iterating global reduction 4 with 19 rules applied. Total rules applied 2631 place count 19 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2635 place count 17 transition count 19
Applied a total of 2635 rules in 26 ms. Remains 17 /1426 variables (removed 1409) and now considering 19/1341 (removed 1322) transitions.
// Phase 1: matrix 19 rows 17 cols
[2022-05-16 16:55:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:55:16] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 19 rows 17 cols
[2022-05-16 16:55:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 16:55:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-16 16:55:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 17 cols
[2022-05-16 16:55:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:55:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/1426 places, 19/1341 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/1426 places, 19/1341 transitions.
Computed a total of 17 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 19
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 : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[p1]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[p1]
Stuttering acceptance computed with spot in 29 ms :[p1]
// Phase 1: matrix 19 rows 17 cols
[2022-05-16 16:55:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:55:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 16:55:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:55:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 16:55:17] [INFO ] Computed and/alt/rep : 15/32/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:55:17] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 26 ms :[p1]
Product exploration explored 100000 steps with 12129 reset in 76 ms.
Product exploration explored 100000 steps with 12037 reset in 81 ms.
Built C files in :
/tmp/ltsmin11409336988642828078
[2022-05-16 16:55:17] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2022-05-16 16:55:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:55:17] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2022-05-16 16:55:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:55:17] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2022-05-16 16:55:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:55:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11409336988642828078
Running compilation step : cd /tmp/ltsmin11409336988642828078;'/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'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin11409336988642828078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11409336988642828078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3355319556504293325.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-14 finished in 18881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F(p2)))'
Support contains 5 out of 2522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Graph (complete) has 3474 edges and 2522 vertex of which 1540 are kept as prefixes of interest. Removing 982 places using SCC suffix rule.3 ms
Discarding 982 places :
Also discarding 970 output transitions
Drop transitions removed 970 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Drop transitions removed 1205 transitions
Trivial Post-agglo rules discarded 1205 transitions
Performed 1205 trivial Post agglomeration. Transition count delta: 1205
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1270 place count 1455 transition count 351
Reduce places removed 1205 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 1268 rules applied. Total rules applied 2538 place count 250 transition count 288
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 46 rules applied. Total rules applied 2584 place count 208 transition count 284
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2588 place count 204 transition count 284
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 2588 place count 204 transition count 199
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 191 rules applied. Total rules applied 2779 place count 98 transition count 199
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2801 place count 76 transition count 157
Iterating global reduction 4 with 22 rules applied. Total rules applied 2823 place count 76 transition count 157
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2843 place count 76 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2843 place count 76 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2845 place count 75 transition count 136
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 2865 place count 55 transition count 96
Iterating global reduction 5 with 20 rules applied. Total rules applied 2885 place count 55 transition count 96
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 2904 place count 36 transition count 58
Iterating global reduction 5 with 19 rules applied. Total rules applied 2923 place count 36 transition count 58
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2940 place count 19 transition count 24
Iterating global reduction 5 with 17 rules applied. Total rules applied 2957 place count 19 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2959 place count 18 transition count 26
Applied a total of 2959 rules in 22 ms. Remains 18 /2522 variables (removed 2504) and now considering 26/2547 (removed 2521) transitions.
// Phase 1: matrix 26 rows 18 cols
[2022-05-16 16:55:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:55:17] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 26 rows 18 cols
[2022-05-16 16:55:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:55:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-16 16:55:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 26 rows 18 cols
[2022-05-16 16:55:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:55:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/2522 places, 26/2547 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/2522 places, 26/2547 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(LEQ 1 s6), p1:(GT s9 s15), p0:(LEQ s17 s7)], 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, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!F(G(X(p0))))) U G((G(p1)||p1)))))'
Found a SL insensitive property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Support contains 126 out of 2522 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2522/2522 places, 2547/2547 transitions.
Graph (complete) has 3474 edges and 2522 vertex of which 1981 are kept as prefixes of interest. Removing 541 places using SCC suffix rule.5 ms
Discarding 541 places :
Also discarding 593 output transitions
Drop transitions removed 593 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Drop transitions removed 1070 transitions
Trivial Post-agglo rules discarded 1070 transitions
Performed 1070 trivial Post agglomeration. Transition count delta: 1070
Iterating post reduction 0 with 1134 rules applied. Total rules applied 1135 place count 1896 transition count 863
Reduce places removed 1070 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 1133 rules applied. Total rules applied 2268 place count 826 transition count 800
Reduce places removed 42 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 2 with 105 rules applied. Total rules applied 2373 place count 784 transition count 737
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 2436 place count 721 transition count 737
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 252 Pre rules applied. Total rules applied 2436 place count 721 transition count 485
Deduced a syphon composed of 252 places in 0 ms
Ensure Unique test removed 84 places
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 588 rules applied. Total rules applied 3024 place count 385 transition count 485
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 4 with 21 rules applied. Total rules applied 3045 place count 364 transition count 485
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3045 place count 364 transition count 464
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3087 place count 343 transition count 464
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3091 place count 339 transition count 400
Iterating global reduction 5 with 4 rules applied. Total rules applied 3095 place count 339 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3095 place count 339 transition count 399
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3097 place count 338 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3139 place count 317 transition count 378
Applied a total of 3139 rules in 51 ms. Remains 317 /2522 variables (removed 2205) and now considering 378/2547 (removed 2169) transitions.
// Phase 1: matrix 378 rows 317 cols
[2022-05-16 16:55:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 16:55:18] [INFO ] Implicit Places using invariants in 83 ms returned [189, 274]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 315/2522 places, 378/2547 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 315 transition count 357
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 294 transition count 357
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 273 transition count 378
Applied a total of 84 rules in 11 ms. Remains 273 /315 variables (removed 42) and now considering 378/378 (removed 0) transitions.
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:55:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:55:18] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 16:55:18] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-16 16:55:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 273/2522 places, 378/2547 transitions.
Finished structural reductions, in 2 iterations. Remains : 273/2522 places, 378/2547 transitions.
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 48665 steps with 2640 reset in 220 ms.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 finished in 791 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F(X(p0))))))'
[2022-05-16 16:55:18] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1769016846880508257
[2022-05-16 16:55:18] [INFO ] Too many transitions (2547) to apply POR reductions. Disabling POR matrices.
[2022-05-16 16:55:18] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1769016846880508257
Running compilation step : cd /tmp/ltsmin1769016846880508257;'/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-16 16:55:18] [INFO ] Applying decomposition
[2022-05-16 16:55:19] [INFO ] Flatten gal took : 63 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/graph7792863883349026416.txt' '-o' '/tmp/graph7792863883349026416.bin' '-w' '/tmp/graph7792863883349026416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7792863883349026416.bin' '-l' '-1' '-v' '-w' '/tmp/graph7792863883349026416.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:55:19] [INFO ] Decomposing Gal with order
[2022-05-16 16:55:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:55:19] [INFO ] Removed a total of 893 redundant transitions.
[2022-05-16 16:55:19] [INFO ] Flatten gal took : 297 ms
[2022-05-16 16:55:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 32 ms.
[2022-05-16 16:55:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality5995666871816106846.gal : 63 ms
[2022-05-16 16:55:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality3386274160644727766.ltl : 1 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/LTLCardinality5995666871816106846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3386274160644727766.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...288
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((gu670.l38_0+gu670.l38_1)+(gu670.l38_2+gu670.l38_3))+((gu670.l38_4+gu670.l38_5)+(gu670.l38_6+gu670.l38_7)))+(((gu67...1386
Formula 0 simplified : !XGFX"((((((gu670.l38_0+gu670.l38_1)+(gu670.l38_2+gu670.l38_3))+((gu670.l38_4+gu670.l38_5)+(gu670.l38_6+gu670.l38_7)))+(((gu670.l38_...1373
Compilation finished in 5510 ms.
Running link step : cd /tmp/ltsmin1769016846880508257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1769016846880508257;'/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((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 17:16:39] [INFO ] Flatten gal took : 149 ms
[2022-05-16 17:16:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality10498920384604190676.gal : 7 ms
[2022-05-16 17:16:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality16838541175182415039.ltl : 1 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/LTLCardinality10498920384604190676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16838541175182415039.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...290
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_...882
Formula 0 simplified : !XGFX"((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38...869
Detected timeout of ITS tools.
[2022-05-16 17:37:59] [INFO ] Flatten gal took : 189 ms
[2022-05-16 17:37:59] [INFO ] Input system was already deterministic with 2547 transitions.
[2022-05-16 17:37:59] [INFO ] Transformed 2522 places.
[2022-05-16 17:37:59] [INFO ] Transformed 2547 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 17:38:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality6384575465267496831.gal : 12 ms
[2022-05-16 17:38:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality2444451214832624495.ltl : 0 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/LTLCardinality6384575465267496831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2444451214832624495.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F(F(X("((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_...882
Formula 0 simplified : !XGFX"((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38...869
BK_TIME_CONFINEMENT_REACHED
--------------------
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="FamilyReunion-PT-L00020M0002C001P001G001"
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 FamilyReunion-PT-L00020M0002C001P001G001, 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 r078-tall-165260110700723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 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 ;