Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K May 18 16:43 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 QuasiCertifProtocol-PT-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716769659981

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 00:27:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 00:27:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:27:41] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-27 00:27:41] [INFO ] Transformed 1398 places.
[2024-05-27 00:27:41] [INFO ] Transformed 296 transitions.
[2024-05-27 00:27:41] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 566 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1397 transition count 296
Applied a total of 1 rules in 97 ms. Remains 1397 /1398 variables (removed 1) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1397 cols
[2024-05-27 00:27:42] [INFO ] Computed 1102 invariants in 46 ms
[2024-05-27 00:27:43] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2024-05-27 00:27:43] [INFO ] Invariant cache hit.
[2024-05-27 00:27:44] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 2507 ms to find 0 implicit places.
[2024-05-27 00:27:44] [INFO ] Invariant cache hit.
[2024-05-27 00:27:44] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1397/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3077 ms. Remains : 1397/1398 places, 296/296 transitions.
Support contains 566 out of 1397 places after structural reductions.
[2024-05-27 00:27:45] [INFO ] Flatten gal took : 128 ms
[2024-05-27 00:27:45] [INFO ] Flatten gal took : 62 ms
[2024-05-27 00:27:45] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 443 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-27 00:27:45] [INFO ] Invariant cache hit.
[2024-05-27 00:27:46] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-27 00:27:46] [INFO ] [Real]Absence check using 1 positive and 1101 generalized place invariants in 186 ms returned sat
[2024-05-27 00:27:46] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-27 00:27:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-27 00:27:47] [INFO ] [Nat]Absence check using 1 positive and 1101 generalized place invariants in 189 ms returned sat
[2024-05-27 00:27:57] [INFO ] After 9374ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :12
[2024-05-27 00:28:02] [INFO ] After 14801ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :12
Attempting to minimize the solution found.
Minimization took 3949 ms.
[2024-05-27 00:28:06] [INFO ] After 19877ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :12
Fused 15 Parikh solutions to 12 different solutions.
Finished Parikh walk after 132 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=22 )
Parikh walk visited 11 properties in 16 ms.
Support contains 2 out of 1397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 578 are kept as prefixes of interest. Removing 819 places using SCC suffix rule.4 ms
Discarding 819 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 540 transition count 83
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 160 place count 521 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 520 transition count 82
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 161 place count 520 transition count 23
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 417 places
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 3 with 535 rules applied. Total rules applied 696 place count 44 transition count 23
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 696 place count 44 transition count 3
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 754 place count 6 transition count 3
Applied a total of 754 rules in 34 ms. Remains 6 /1397 variables (removed 1391) and now considering 3/296 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 6/1397 places, 3/296 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 1397 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 transition count 296
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 361 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 207 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-27 00:28:07] [INFO ] Computed 1062 invariants in 33 ms
[2024-05-27 00:28:08] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2024-05-27 00:28:08] [INFO ] Invariant cache hit.
[2024-05-27 00:28:10] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2891 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1397 places, 296/296 transitions.
Applied a total of 0 rules in 60 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3160 ms. Remains : 1337/1397 places, 296/296 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-00 finished in 3458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 76 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 1355 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.14 ms
Discarding 42 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1354 transition count 293
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1354 transition count 293
Applied a total of 4 rules in 158 ms. Remains 1354 /1397 variables (removed 43) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1354 cols
[2024-05-27 00:28:10] [INFO ] Computed 1063 invariants in 13 ms
[2024-05-27 00:28:11] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2024-05-27 00:28:11] [INFO ] Invariant cache hit.
[2024-05-27 00:28:14] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned [830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 943, 944, 945, 946, 947, 948, 949, 950, 951]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 4029 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1397 places, 293/296 transitions.
Applied a total of 0 rules in 70 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4257 ms. Remains : 1335/1397 places, 293/296 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 3 (ADD s1271 s1272 s1273 s1274 s1275 s1276 s1277 s1278 s1319 s1320 s1321 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334)), p0:(AND (LEQ 2 (ADD s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10804 reset in 612 ms.
Product exploration explored 100000 steps with 10857 reset in 479 ms.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 1335 cols
[2024-05-27 00:28:16] [INFO ] Computed 1044 invariants in 15 ms
[2024-05-27 00:28:16] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:28:16] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 177 ms returned sat
[2024-05-27 00:28:17] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 00:28:19] [INFO ] After 2121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 249 ms.
[2024-05-27 00:28:19] [INFO ] After 2710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-27 00:28:19] [INFO ] Invariant cache hit.
[2024-05-27 00:28:21] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1176 ms returned sat
[2024-05-27 00:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:33] [INFO ] [Real]Absence check using state equation in 12245 ms returned sat
[2024-05-27 00:28:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:28:35] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1251 ms returned sat
[2024-05-27 00:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:43] [INFO ] [Nat]Absence check using state equation in 8261 ms returned sat
[2024-05-27 00:28:43] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 25 ms.
[2024-05-27 00:28:43] [INFO ] Added : 0 causal constraints over 0 iterations in 179 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 57 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-27 00:28:43] [INFO ] Invariant cache hit.
[2024-05-27 00:28:44] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2024-05-27 00:28:45] [INFO ] Invariant cache hit.
[2024-05-27 00:28:47] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
[2024-05-27 00:28:47] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-27 00:28:47] [INFO ] Invariant cache hit.
[2024-05-27 00:28:47] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3582 ms. Remains : 1335/1335 places, 293/293 transitions.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 439 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 00:28:48] [INFO ] Invariant cache hit.
[2024-05-27 00:28:48] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:28:48] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 179 ms returned sat
[2024-05-27 00:28:49] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 00:28:49] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1765 ms.
[2024-05-27 00:28:51] [INFO ] After 3144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 352 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-27 00:28:51] [INFO ] Invariant cache hit.
[2024-05-27 00:28:53] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1269 ms returned sat
[2024-05-27 00:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:06] [INFO ] [Real]Absence check using state equation in 13227 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10791 reset in 467 ms.
Product exploration explored 100000 steps with 10794 reset in 475 ms.
Built C files in :
/tmp/ltsmin8492937398274872642
[2024-05-27 00:29:07] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-27 00:29:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:29:07] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-27 00:29:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:29:07] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-27 00:29:07] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:29:07] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8492937398274872642
Running compilation step : cd /tmp/ltsmin8492937398274872642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1277 ms.
Running link step : cd /tmp/ltsmin8492937398274872642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8492937398274872642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6347614365857453014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 61 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-27 00:29:23] [INFO ] Invariant cache hit.
[2024-05-27 00:29:24] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-27 00:29:24] [INFO ] Invariant cache hit.
[2024-05-27 00:29:26] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 3133 ms to find 0 implicit places.
[2024-05-27 00:29:26] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-27 00:29:26] [INFO ] Invariant cache hit.
[2024-05-27 00:29:26] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3647 ms. Remains : 1335/1335 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin11765495307948525405
[2024-05-27 00:29:26] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2024-05-27 00:29:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:29:26] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2024-05-27 00:29:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:29:26] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2024-05-27 00:29:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:29:26] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11765495307948525405
Running compilation step : cd /tmp/ltsmin11765495307948525405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1025 ms.
Running link step : cd /tmp/ltsmin11765495307948525405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11765495307948525405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7123764430167418366.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:29:41] [INFO ] Flatten gal took : 44 ms
[2024-05-27 00:29:41] [INFO ] Flatten gal took : 41 ms
[2024-05-27 00:29:41] [INFO ] Time to serialize gal into /tmp/LTL1433894731891601791.gal : 7 ms
[2024-05-27 00:29:41] [INFO ] Time to serialize properties into /tmp/LTL5799860441752403574.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1433894731891601791.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14377291462249324099.hoa' '-atoms' '/tmp/LTL5799860441752403574.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5799860441752403574.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14377291462249324099.hoa
Detected timeout of ITS tools.
[2024-05-27 00:29:56] [INFO ] Flatten gal took : 43 ms
[2024-05-27 00:29:57] [INFO ] Flatten gal took : 37 ms
[2024-05-27 00:29:57] [INFO ] Time to serialize gal into /tmp/LTL6936446255147651488.gal : 6 ms
[2024-05-27 00:29:57] [INFO ] Time to serialize properties into /tmp/LTL11965904335638588869.ltl : 99 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6936446255147651488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11965904335638588869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((n3_3+n3_2)+(n3_1+n3_0))+((n3_7+n3_6)+(n3_5+n3_4)))+(((n3_16+n3_17)+(n3_18+n3_8))+((n3_9+n3_10)+(n3_11+n3_12))))+((n3_13...711
Formula 0 simplified : G(!"(((((((n1_4+n1_5)+(n1_2+n1_3))+((n1_0+n1_1)+(n1_12+n1_13)))+(((n1_10+n1_11)+(n1_8+n1_9))+((n1_6+n1_7)+(n1_16+n1_17))))+((n1_14+n...705
Detected timeout of ITS tools.
[2024-05-27 00:30:12] [INFO ] Flatten gal took : 32 ms
[2024-05-27 00:30:12] [INFO ] Applying decomposition
[2024-05-27 00:30:12] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph771801047098375840.txt' '-o' '/tmp/graph771801047098375840.bin' '-w' '/tmp/graph771801047098375840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph771801047098375840.bin' '-l' '-1' '-v' '-w' '/tmp/graph771801047098375840.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:30:12] [INFO ] Decomposing Gal with order
[2024-05-27 00:30:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:30:12] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-27 00:30:12] [INFO ] Flatten gal took : 195 ms
[2024-05-27 00:30:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 123 ms.
[2024-05-27 00:30:13] [INFO ] Time to serialize gal into /tmp/LTL17899834543763028971.gal : 16 ms
[2024-05-27 00:30:13] [INFO ] Time to serialize properties into /tmp/LTL2321145850300864846.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17899834543763028971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2321145850300864846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((gu60.n3_3+gu60.n3_2)+(gu60.n3_1+gu60.n3_0))+((gu60.n3_7+gu60.n3_6)+(gu60.n3_5+gu60.n3_4)))+(((gu60.n3_16+gu60.n3_17)+(g...1167
Formula 0 simplified : G(!"(((((((gi3.gu54.n1_4+gi3.gu54.n1_5)+(gi3.gu54.n1_2+gi3.gu54.n1_3))+((gi3.gu54.n1_0+gi3.gu54.n1_1)+(gi3.gu54.n1_12+gi3.gu54.n1_13...1161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9555819611451950568
[2024-05-27 00:30:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9555819611451950568
Running compilation step : cd /tmp/ltsmin9555819611451950568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin9555819611451950568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9555819611451950568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 152996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 1336 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.4 ms
Discarding 61 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1334 transition count 292
Applied a total of 3 rules in 91 ms. Remains 1334 /1397 variables (removed 63) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-05-27 00:30:43] [INFO ] Computed 1044 invariants in 13 ms
[2024-05-27 00:30:44] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2024-05-27 00:30:44] [INFO ] Invariant cache hit.
[2024-05-27 00:30:47] [INFO ] Implicit Places using invariants and state equation in 2421 ms returned [811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 924, 925, 926, 927, 928, 929, 930, 931, 932, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1294, 1295, 1296, 1297, 1300]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3806 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1397 places, 292/296 transitions.
Applied a total of 0 rules in 51 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3949 ms. Remains : 1296/1397 places, 292/296 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-03 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 s127 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], 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 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-03 finished in 4032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Support contains 59 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1376 transition count 296
Applied a total of 21 rules in 50 ms. Remains 1376 /1397 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1376 cols
[2024-05-27 00:30:47] [INFO ] Computed 1081 invariants in 11 ms
[2024-05-27 00:30:48] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2024-05-27 00:30:48] [INFO ] Invariant cache hit.
[2024-05-27 00:30:51] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3669 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1397 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3750 ms. Remains : 1357/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 8}, { cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 9}]], initial=0, aps=[p0:(LEQ 1 s1271), p2:(LEQ (ADD s75 s76 s77 s78 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s93 s95 s96 s97 s98) s146), p1:(LEQ (ADD s20 s21 s22 s23 s24 s25 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4422 reset in 306 ms.
Product exploration explored 100000 steps with 4413 reset in 284 ms.
Computed a total of 1357 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1357 transition count 296
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) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1963149 steps, run timeout after 3001 ms. (steps per millisecond=654 ) properties seen :{}
Probabilistic random walk after 1963149 steps, saw 276985 distinct states, run finished after 3002 ms. (steps per millisecond=653 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-27 00:30:55] [INFO ] Computed 1062 invariants in 18 ms
[2024-05-27 00:30:56] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:30:56] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 182 ms returned sat
[2024-05-27 00:30:56] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 00:30:56] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-27 00:30:56] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1357 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 : 1357/1357 places, 296/296 transitions.
Graph (complete) has 8708 edges and 1357 vertex of which 996 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.7 ms
Discarding 361 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 978 transition count 260
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 978 transition count 260
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 976 transition count 258
Applied a total of 41 rules in 155 ms. Remains 976 /1357 variables (removed 381) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 976 cols
[2024-05-27 00:30:57] [INFO ] Computed 720 invariants in 5 ms
[2024-05-27 00:30:58] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-05-27 00:30:58] [INFO ] Invariant cache hit.
[2024-05-27 00:30:59] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2024-05-27 00:30:59] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-27 00:30:59] [INFO ] Invariant cache hit.
[2024-05-27 00:30:59] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1357 places, 258/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2489 ms. Remains : 976/1357 places, 258/296 transitions.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2068640 steps, run timeout after 3001 ms. (steps per millisecond=689 ) properties seen :{}
Probabilistic random walk after 2068640 steps, saw 290797 distinct states, run finished after 3001 ms. (steps per millisecond=689 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 00:31:03] [INFO ] Invariant cache hit.
[2024-05-27 00:31:03] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:31:03] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 117 ms returned sat
[2024-05-27 00:31:04] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 00:31:04] [INFO ] After 662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-27 00:31:04] [INFO ] After 989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4421 reset in 249 ms.
Product exploration explored 100000 steps with 4419 reset in 263 ms.
Built C files in :
/tmp/ltsmin2757022946974673530
[2024-05-27 00:31:05] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-27 00:31:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:05] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-27 00:31:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:05] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-27 00:31:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:05] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2757022946974673530
Running compilation step : cd /tmp/ltsmin2757022946974673530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 843 ms.
Running link step : cd /tmp/ltsmin2757022946974673530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2757022946974673530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16075882145038406971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Graph (complete) has 9067 edges and 976 vertex of which 936 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 917 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 917 transition count 218
Applied a total of 39 rules in 56 ms. Remains 917 /976 variables (removed 59) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 917 cols
[2024-05-27 00:31:20] [INFO ] Computed 702 invariants in 15 ms
[2024-05-27 00:31:21] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-27 00:31:21] [INFO ] Invariant cache hit.
[2024-05-27 00:31:22] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
[2024-05-27 00:31:22] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-27 00:31:22] [INFO ] Invariant cache hit.
[2024-05-27 00:31:23] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/976 places, 218/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2763 ms. Remains : 917/976 places, 218/258 transitions.
Built C files in :
/tmp/ltsmin69788542622182392
[2024-05-27 00:31:23] [INFO ] Computing symmetric may disable matrix : 218 transitions.
[2024-05-27 00:31:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:23] [INFO ] Computing symmetric may enable matrix : 218 transitions.
[2024-05-27 00:31:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:23] [INFO ] Computing Do-Not-Accords matrix : 218 transitions.
[2024-05-27 00:31:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:31:23] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin69788542622182392
Running compilation step : cd /tmp/ltsmin69788542622182392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 730 ms.
Running link step : cd /tmp/ltsmin69788542622182392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin69788542622182392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16285847408007630024.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:31:38] [INFO ] Flatten gal took : 27 ms
[2024-05-27 00:31:38] [INFO ] Flatten gal took : 27 ms
[2024-05-27 00:31:38] [INFO ] Time to serialize gal into /tmp/LTL17064707366731811936.gal : 4 ms
[2024-05-27 00:31:38] [INFO ] Time to serialize properties into /tmp/LTL5828635877485083724.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17064707366731811936.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11439607494692210163.hoa' '-atoms' '/tmp/LTL5828635877485083724.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5828635877485083724.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11439607494692210163.hoa
Detected timeout of ITS tools.
[2024-05-27 00:31:53] [INFO ] Flatten gal took : 22 ms
[2024-05-27 00:31:53] [INFO ] Flatten gal took : 21 ms
[2024-05-27 00:31:53] [INFO ] Time to serialize gal into /tmp/LTL16771245482741505802.gal : 3 ms
[2024-05-27 00:31:53] [INFO ] Time to serialize properties into /tmp/LTL9337846483265259354.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16771245482741505802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9337846483265259354.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
Detected timeout of ITS tools.
[2024-05-27 00:32:08] [INFO ] Flatten gal took : 21 ms
[2024-05-27 00:32:08] [INFO ] Applying decomposition
[2024-05-27 00:32:08] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15556291622459085304.txt' '-o' '/tmp/graph15556291622459085304.bin' '-w' '/tmp/graph15556291622459085304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15556291622459085304.bin' '-l' '-1' '-v' '-w' '/tmp/graph15556291622459085304.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:32:08] [INFO ] Decomposing Gal with order
[2024-05-27 00:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:32:08] [INFO ] Removed a total of 198 redundant transitions.
[2024-05-27 00:32:08] [INFO ] Flatten gal took : 103 ms
[2024-05-27 00:32:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 48 ms.
[2024-05-27 00:32:09] [INFO ] Time to serialize gal into /tmp/LTL13249195083227086664.gal : 49 ms
[2024-05-27 00:32:09] [INFO ] Time to serialize properties into /tmp/LTL397230129700593524.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13249195083227086664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL397230129700593524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("(gi2.gi1.gi3.gi9.gu64.AstopOK>=1)")U(X(X(G(("(gi2.gi1.gi3.gi9.gu64.AstopOK>=1)")||(X(G((F(G("((((((gu65.s6_1+gu65.s6_0)+(gu65.s6_...949
Formula 0 simplified : !"(gi2.gi1.gi3.gi9.gu64.AstopOK>=1)" R XXF(!"(gi2.gi1.gi3.gi9.gu64.AstopOK>=1)" & XF(GF!"((((((gu65.s6_1+gu65.s6_0)+(gu65.s6_3+gu65....933
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6592806638899138321
[2024-05-27 00:32:24] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6592806638899138321
Running compilation step : cd /tmp/ltsmin6592806638899138321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 718 ms.
Running link step : cd /tmp/ltsmin6592806638899138321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6592806638899138321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X(X([](((LTLAPp0==true)||X([]((<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 112205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&(p1||F(((p2&&X(F(p3)))||G(F(p3)))))))))'
Support contains 77 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1376 transition count 296
Applied a total of 21 rules in 41 ms. Remains 1376 /1397 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1376 cols
[2024-05-27 00:32:39] [INFO ] Computed 1082 invariants in 18 ms
[2024-05-27 00:32:40] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2024-05-27 00:32:40] [INFO ] Invariant cache hit.
[2024-05-27 00:32:43] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned [814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 927, 928, 929, 930, 931, 932, 933, 934, 935]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3753 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1397 places, 296/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3830 ms. Remains : 1357/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 301 ms :[p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p0 p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p3)) (AND p0 p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s19), p2:(GT (ADD s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s1289 s1290 s1291 s1292) (ADD s92 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 4165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1357 transition count 296
Applied a total of 40 rules in 52 ms. Remains 1357 /1397 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-27 00:32:43] [INFO ] Computed 1062 invariants in 27 ms
[2024-05-27 00:32:45] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2024-05-27 00:32:45] [INFO ] Invariant cache hit.
[2024-05-27 00:32:47] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned [814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 927, 928, 929, 930, 931, 932, 933, 934, 935]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3663 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1397 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3752 ms. Remains : 1338/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s1239 s128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 681 ms.
Product exploration explored 100000 steps with 33333 reset in 692 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-08 finished in 5495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 1336 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.7 ms
Discarding 61 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1333 transition count 291
Applied a total of 5 rules in 115 ms. Remains 1333 /1397 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-27 00:32:49] [INFO ] Computed 1044 invariants in 12 ms
[2024-05-27 00:32:50] [INFO ] Implicit Places using invariants in 1322 ms returned []
[2024-05-27 00:32:50] [INFO ] Invariant cache hit.
[2024-05-27 00:32:53] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned [810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 923, 924, 925, 926, 927, 928, 929, 930, 931, 1172, 1173, 1174, 1175, 1176, 1177, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1293, 1294, 1295, 1296, 1299]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3839 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1397 places, 291/296 transitions.
Applied a total of 0 rules in 112 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4066 ms. Remains : 1295/1397 places, 291/296 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 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 s0 s1277)], 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 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 4141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 1337 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.2 ms
Discarding 60 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 1334 transition count 291
Applied a total of 5 rules in 221 ms. Remains 1334 /1397 variables (removed 63) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1334 cols
[2024-05-27 00:32:53] [INFO ] Computed 1045 invariants in 31 ms
[2024-05-27 00:32:54] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-27 00:32:54] [INFO ] Invariant cache hit.
[2024-05-27 00:32:57] [INFO ] Implicit Places using invariants and state equation in 2596 ms returned [811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 924, 925, 926, 927, 928, 929, 930, 931, 932, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1294, 1295, 1296, 1297, 1300]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3865 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1397 places, 291/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1296 /1296 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4131 ms. Remains : 1296/1397 places, 291/296 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 4173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 989 are kept as prefixes of interest. Removing 408 places using SCC suffix rule.4 ms
Discarding 408 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 988 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 958 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 958 transition count 222
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 1 with 4 rules applied. Total rules applied 71 place count 956 transition count 220
Applied a total of 71 rules in 81 ms. Remains 956 /1397 variables (removed 441) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 956 cols
[2024-05-27 00:32:57] [INFO ] Computed 738 invariants in 5 ms
[2024-05-27 00:32:58] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-27 00:32:58] [INFO ] Invariant cache hit.
[2024-05-27 00:33:00] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned [413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 526, 527, 528, 529, 530, 531, 532, 533, 534, 775, 776, 777, 778, 779, 780, 783, 784, 785, 786, 787, 788, 789, 790, 916, 917, 918, 919, 922]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 2464 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/1397 places, 220/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2571 ms. Remains : 918/1397 places, 220/296 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s854)], 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 4148 reset in 302 ms.
Product exploration explored 100000 steps with 4149 reset in 250 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 386 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2566237 steps, run timeout after 3001 ms. (steps per millisecond=855 ) properties seen :{}
Probabilistic random walk after 2566237 steps, saw 353931 distinct states, run finished after 3001 ms. (steps per millisecond=855 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 918 cols
[2024-05-27 00:33:04] [INFO ] Computed 702 invariants in 12 ms
[2024-05-27 00:33:04] [INFO ] [Real]Absence check using 0 positive and 702 generalized place invariants in 115 ms returned sat
[2024-05-27 00:33:04] [INFO ] After 215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 00:33:04] [INFO ] After 255ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-27 00:33:04] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 1 ms.
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 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Support contains 1 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 28 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-27 00:33:04] [INFO ] Invariant cache hit.
[2024-05-27 00:33:05] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-27 00:33:05] [INFO ] Invariant cache hit.
[2024-05-27 00:33:07] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
[2024-05-27 00:33:07] [INFO ] Redundant transitions in 22 ms returned [183]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 219 rows 918 cols
[2024-05-27 00:33:07] [INFO ] Computed 702 invariants in 4 ms
[2024-05-27 00:33:07] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8857 edges and 918 vertex of which 195 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.2 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 177 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 177 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 159 transition count 127
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 159 transition count 127
Applied a total of 73 rules in 16 ms. Remains 159 /918 variables (removed 759) and now considering 127/219 (removed 92) transitions.
// Phase 1: matrix 127 rows 159 cols
[2024-05-27 00:33:07] [INFO ] Computed 36 invariants in 2 ms
[2024-05-27 00:33:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 00:33:07] [INFO ] Invariant cache hit.
[2024-05-27 00:33:07] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/918 places, 127/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2804 ms. Remains : 159/918 places, 127/220 transitions.
Computed a total of 159 stabilizing places and 127 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 127
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 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3049810 steps, run timeout after 3001 ms. (steps per millisecond=1016 ) properties seen :{}
Probabilistic random walk after 3049810 steps, saw 415255 distinct states, run finished after 3001 ms. (steps per millisecond=1016 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 00:33:10] [INFO ] Invariant cache hit.
[2024-05-27 00:33:11] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 4 ms returned sat
[2024-05-27 00:33:11] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 00:33:11] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-27 00:33:11] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 1 ms.
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 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Product exploration explored 100000 steps with 4153 reset in 234 ms.
Product exploration explored 100000 steps with 4164 reset in 248 ms.
Built C files in :
/tmp/ltsmin1834483590875226756
[2024-05-27 00:33:11] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-27 00:33:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:33:11] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-27 00:33:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:33:11] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-27 00:33:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:33:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1834483590875226756
Running compilation step : cd /tmp/ltsmin1834483590875226756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin1834483590875226756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1834483590875226756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10765605119841110967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 127/127 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-27 00:33:27] [INFO ] Invariant cache hit.
[2024-05-27 00:33:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 00:33:27] [INFO ] Invariant cache hit.
[2024-05-27 00:33:27] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-27 00:33:27] [INFO ] Redundant transitions in 18 ms returned [122]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 126 rows 159 cols
[2024-05-27 00:33:27] [INFO ] Computed 36 invariants in 1 ms
[2024-05-27 00:33:27] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/159 places, 126/127 transitions.
Graph (complete) has 1011 edges and 159 vertex of which 158 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
Applied a total of 1 rules in 4 ms. Remains 158 /159 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 158 cols
[2024-05-27 00:33:27] [INFO ] Computed 36 invariants in 0 ms
[2024-05-27 00:33:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 00:33:27] [INFO ] Invariant cache hit.
[2024-05-27 00:33:27] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/159 places, 125/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 519 ms. Remains : 158/159 places, 125/127 transitions.
Built C files in :
/tmp/ltsmin2664254177715836868
[2024-05-27 00:33:27] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-27 00:33:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:33:27] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-27 00:33:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:33:27] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-27 00:33:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:33:27] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2664254177715836868
Running compilation step : cd /tmp/ltsmin2664254177715836868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin2664254177715836868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2664254177715836868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18022810144007413992.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:33:42] [INFO ] Flatten gal took : 7 ms
[2024-05-27 00:33:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 00:33:42] [INFO ] Time to serialize gal into /tmp/LTL16270628638759691419.gal : 2 ms
[2024-05-27 00:33:42] [INFO ] Time to serialize properties into /tmp/LTL12575958174339108303.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16270628638759691419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14446495671393412589.hoa' '-atoms' '/tmp/LTL12575958174339108303.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12575958174339108303.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14446495671393412589.hoa
Detected timeout of ITS tools.
[2024-05-27 00:33:57] [INFO ] Flatten gal took : 10 ms
[2024-05-27 00:33:57] [INFO ] Flatten gal took : 6 ms
[2024-05-27 00:33:57] [INFO ] Time to serialize gal into /tmp/LTL8954964882489426359.gal : 2 ms
[2024-05-27 00:33:57] [INFO ] Time to serialize properties into /tmp/LTL72035383566016685.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8954964882489426359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL72035383566016685.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((G(F("(AstopOK<1)"))))
Formula 0 simplified : FG!"(AstopOK<1)"
Detected timeout of ITS tools.
[2024-05-27 00:34:12] [INFO ] Flatten gal took : 11 ms
[2024-05-27 00:34:12] [INFO ] Applying decomposition
[2024-05-27 00:34:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12907477632644171810.txt' '-o' '/tmp/graph12907477632644171810.bin' '-w' '/tmp/graph12907477632644171810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12907477632644171810.bin' '-l' '-1' '-v' '-w' '/tmp/graph12907477632644171810.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:34:12] [INFO ] Decomposing Gal with order
[2024-05-27 00:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:34:12] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-27 00:34:12] [INFO ] Flatten gal took : 10 ms
[2024-05-27 00:34:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 4 ms.
[2024-05-27 00:34:12] [INFO ] Time to serialize gal into /tmp/LTL15709533978771208955.gal : 12 ms
[2024-05-27 00:34:12] [INFO ] Time to serialize properties into /tmp/LTL11114620353165483743.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15709533978771208955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11114620353165483743.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i20.i0.u10.AstopOK<1)"))))
Formula 0 simplified : FG!"(i20.i0.u10.AstopOK<1)"
Reverse transition relation is NOT exact ! Due to transitions t170, t171, t176, t177, t179, t180, t183, t193, t198, t201, t202, t203, t207, t209, t212, t21...370
Computing Next relation with stutter on 3.40804e+08 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10686468460950226365
[2024-05-27 00:34:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10686468460950226365
Running compilation step : cd /tmp/ltsmin10686468460950226365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin10686468460950226365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10686468460950226365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 105545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 4 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1357 transition count 296
Applied a total of 40 rules in 40 ms. Remains 1357 /1397 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1357 cols
[2024-05-27 00:34:43] [INFO ] Computed 1063 invariants in 21 ms
[2024-05-27 00:34:44] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-27 00:34:44] [INFO ] Invariant cache hit.
[2024-05-27 00:34:47] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3907 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1397 places, 296/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3995 ms. Remains : 1338/1397 places, 296/296 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(LEQ s1269 s1261), p1:(LEQ s1268 s125)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10743 reset in 359 ms.
Product exploration explored 100000 steps with 10777 reset in 374 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1338 cols
[2024-05-27 00:34:48] [INFO ] Computed 1044 invariants in 8 ms
[2024-05-27 00:34:48] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:34:49] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 166 ms returned sat
[2024-05-27 00:34:49] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-15 finished in 6693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 59 out of 1397 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9493 edges and 1397 vertex of which 1015 are kept as prefixes of interest. Removing 382 places using SCC suffix rule.8 ms
Discarding 382 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 997 transition count 260
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 997 transition count 260
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 0 with 4 rules applied. Total rules applied 41 place count 995 transition count 258
Applied a total of 41 rules in 86 ms. Remains 995 /1397 variables (removed 402) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 995 cols
[2024-05-27 00:34:50] [INFO ] Computed 738 invariants in 7 ms
[2024-05-27 00:34:51] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-05-27 00:34:51] [INFO ] Invariant cache hit.
[2024-05-27 00:34:52] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned [432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 545, 546, 547, 548, 549, 550, 551, 552, 553]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2243 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 976/1397 places, 258/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 976 /976 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2358 ms. Remains : 976/1397 places, 258/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 8}, { cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 9}]], initial=0, aps=[p0:(LEQ 1 s890), p2:(LEQ (ADD s57 s58 s59 s60 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s75 s77 s78 s79 s80) s118), p1:(LEQ (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4419 reset in 277 ms.
Product exploration explored 100000 steps with 4418 reset in 297 ms.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 443 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1997801 steps, run timeout after 3001 ms. (steps per millisecond=665 ) properties seen :{}
Probabilistic random walk after 1997801 steps, saw 281534 distinct states, run finished after 3002 ms. (steps per millisecond=665 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 258 rows 976 cols
[2024-05-27 00:34:56] [INFO ] Computed 720 invariants in 11 ms
[2024-05-27 00:34:57] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:34:57] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 131 ms returned sat
[2024-05-27 00:34:57] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 00:34:57] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-27 00:34:57] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 976 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 : 976/976 places, 258/258 transitions.
Applied a total of 0 rules in 31 ms. Remains 976 /976 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-27 00:34:58] [INFO ] Invariant cache hit.
[2024-05-27 00:34:59] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-05-27 00:34:59] [INFO ] Invariant cache hit.
[2024-05-27 00:35:00] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2024-05-27 00:35:00] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-27 00:35:00] [INFO ] Invariant cache hit.
[2024-05-27 00:35:00] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2469 ms. Remains : 976/976 places, 258/258 transitions.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2109499 steps, run timeout after 3001 ms. (steps per millisecond=702 ) properties seen :{}
Probabilistic random walk after 2109499 steps, saw 296178 distinct states, run finished after 3001 ms. (steps per millisecond=702 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 00:35:04] [INFO ] Invariant cache hit.
[2024-05-27 00:35:04] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:35:04] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 111 ms returned sat
[2024-05-27 00:35:05] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 00:35:05] [INFO ] After 672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-27 00:35:05] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4422 reset in 240 ms.
Product exploration explored 100000 steps with 4421 reset in 250 ms.
Built C files in :
/tmp/ltsmin8683219215931808333
[2024-05-27 00:35:06] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-05-27 00:35:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:35:06] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-05-27 00:35:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:35:06] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-05-27 00:35:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:35:06] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8683219215931808333
Running compilation step : cd /tmp/ltsmin8683219215931808333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 834 ms.
Running link step : cd /tmp/ltsmin8683219215931808333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8683219215931808333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4123507188160797412.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Graph (complete) has 9067 edges and 976 vertex of which 936 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 917 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 917 transition count 218
Applied a total of 39 rules in 54 ms. Remains 917 /976 variables (removed 59) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 917 cols
[2024-05-27 00:35:21] [INFO ] Computed 702 invariants in 15 ms
[2024-05-27 00:35:21] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-27 00:35:21] [INFO ] Invariant cache hit.
[2024-05-27 00:35:23] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2024-05-27 00:35:23] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-27 00:35:23] [INFO ] Invariant cache hit.
[2024-05-27 00:35:23] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/976 places, 218/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2708 ms. Remains : 917/976 places, 218/258 transitions.
Built C files in :
/tmp/ltsmin6901466724156863252
[2024-05-27 00:35:23] [INFO ] Computing symmetric may disable matrix : 218 transitions.
[2024-05-27 00:35:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:35:23] [INFO ] Computing symmetric may enable matrix : 218 transitions.
[2024-05-27 00:35:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:35:23] [INFO ] Computing Do-Not-Accords matrix : 218 transitions.
[2024-05-27 00:35:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:35:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6901466724156863252
Running compilation step : cd /tmp/ltsmin6901466724156863252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 748 ms.
Running link step : cd /tmp/ltsmin6901466724156863252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6901466724156863252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14222096188534042503.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 00:35:39] [INFO ] Flatten gal took : 21 ms
[2024-05-27 00:35:39] [INFO ] Flatten gal took : 18 ms
[2024-05-27 00:35:39] [INFO ] Time to serialize gal into /tmp/LTL10276437159237027172.gal : 17 ms
[2024-05-27 00:35:39] [INFO ] Time to serialize properties into /tmp/LTL17860850221106375749.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10276437159237027172.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6234977448137322493.hoa' '-atoms' '/tmp/LTL17860850221106375749.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17860850221106375749.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6234977448137322493.hoa
Detected timeout of ITS tools.
[2024-05-27 00:35:54] [INFO ] Flatten gal took : 20 ms
[2024-05-27 00:35:54] [INFO ] Flatten gal took : 19 ms
[2024-05-27 00:35:54] [INFO ] Time to serialize gal into /tmp/LTL5946834205398117339.gal : 5 ms
[2024-05-27 00:35:54] [INFO ] Time to serialize properties into /tmp/LTL10023715166807472238.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5946834205398117339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10023715166807472238.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
Detected timeout of ITS tools.
[2024-05-27 00:36:09] [INFO ] Flatten gal took : 19 ms
[2024-05-27 00:36:09] [INFO ] Applying decomposition
[2024-05-27 00:36:09] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3887360116496596245.txt' '-o' '/tmp/graph3887360116496596245.bin' '-w' '/tmp/graph3887360116496596245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3887360116496596245.bin' '-l' '-1' '-v' '-w' '/tmp/graph3887360116496596245.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:36:09] [INFO ] Decomposing Gal with order
[2024-05-27 00:36:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:36:09] [INFO ] Removed a total of 197 redundant transitions.
[2024-05-27 00:36:09] [INFO ] Flatten gal took : 41 ms
[2024-05-27 00:36:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 26 ms.
[2024-05-27 00:36:09] [INFO ] Time to serialize gal into /tmp/LTL16650914135175498632.gal : 9 ms
[2024-05-27 00:36:09] [INFO ] Time to serialize properties into /tmp/LTL7786369884825929967.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16650914135175498632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7786369884825929967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(gi3.gi0.gi9.gu32.AstopOK>=1)")U(X(X(G(("(gi3.gi0.gi9.gu32.AstopOK>=1)")||(X(G((F(G("((((((gu1.s6_1+gu1.s6_0)+(gu1.s6_3+gu1.s6_2)...983
Formula 0 simplified : !"(gi3.gi0.gi9.gu32.AstopOK>=1)" R XXF(!"(gi3.gi0.gi9.gu32.AstopOK>=1)" & XF(GF!"((((((gu1.s6_1+gu1.s6_0)+(gu1.s6_3+gu1.s6_2))+((gu1...967
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15843167443408648311
[2024-05-27 00:36:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15843167443408648311
Running compilation step : cd /tmp/ltsmin15843167443408648311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 699 ms.
Running link step : cd /tmp/ltsmin15843167443408648311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15843167443408648311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X(X([](((LTLAPp0==true)||X([]((<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 109856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
[2024-05-27 00:36:39] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2999212542030528946
[2024-05-27 00:36:39] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-27 00:36:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:36:39] [INFO ] Applying decomposition
[2024-05-27 00:36:39] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-27 00:36:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:36:39] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-27 00:36:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:36:39] [INFO ] Flatten gal took : 25 ms
[2024-05-27 00:36:39] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2999212542030528946
Running compilation step : cd /tmp/ltsmin2999212542030528946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph249385874574954834.txt' '-o' '/tmp/graph249385874574954834.bin' '-w' '/tmp/graph249385874574954834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph249385874574954834.bin' '-l' '-1' '-v' '-w' '/tmp/graph249385874574954834.weights' '-q' '0' '-e' '0.001'
[2024-05-27 00:36:40] [INFO ] Decomposing Gal with order
[2024-05-27 00:36:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 00:36:40] [INFO ] Removed a total of 152 redundant transitions.
[2024-05-27 00:36:40] [INFO ] Flatten gal took : 52 ms
[2024-05-27 00:36:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 13 ms.
[2024-05-27 00:36:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality7963272790244260324.gal : 7 ms
[2024-05-27 00:36:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality17278724311711961201.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7963272790244260324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17278724311711961201.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(("(((((((gi3.gi0.gi7.gu41.n1_4+gi3.gi0.gi7.gu41.n1_5)+(gi3.gi0.gi7.gu41.n1_2+gi3.gi0.gi7.gu41.n1_3))+((gi3.gi0.gi7.gu41.n1_0+gi3....1281
Formula 0 simplified : G(!"(((((((gi3.gi0.gi7.gu41.n1_4+gi3.gi0.gi7.gu41.n1_5)+(gi3.gi0.gi7.gu41.n1_2+gi3.gi0.gi7.gu41.n1_3))+((gi3.gi0.gi7.gu41.n1_0+gi3.g...1275
Compilation finished in 1157 ms.
Running link step : cd /tmp/ltsmin2999212542030528946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2999212542030528946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 79697 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2999212542030528946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: LTL layer: formula: ((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))
pins2lts-mc-linux64( 2/ 8), 0.015: "((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.015: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.189: There are 302 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.189: State length is 1398, there are 320 groups
pins2lts-mc-linux64( 0/ 8), 0.189: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.189: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.189: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.189: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.238: [Blue] ~22 levels ~960 states ~4232 transitions
pins2lts-mc-linux64( 2/ 8), 0.259: [Blue] ~22 levels ~1920 states ~8360 transitions
pins2lts-mc-linux64( 2/ 8), 0.299: [Blue] ~22 levels ~3840 states ~17576 transitions
pins2lts-mc-linux64( 2/ 8), 0.450: [Blue] ~22 levels ~7680 states ~38056 transitions
pins2lts-mc-linux64( 2/ 8), 0.726: [Blue] ~22 levels ~15360 states ~74152 transitions
pins2lts-mc-linux64( 2/ 8), 1.171: [Blue] ~23 levels ~30720 states ~147536 transitions
pins2lts-mc-linux64( 6/ 8), 1.943: [Blue] ~23 levels ~61440 states ~312088 transitions
pins2lts-mc-linux64( 2/ 8), 3.392: [Blue] ~23 levels ~122880 states ~707136 transitions
pins2lts-mc-linux64( 2/ 8), 6.174: [Blue] ~23 levels ~245760 states ~1491576 transitions
pins2lts-mc-linux64( 2/ 8), 11.433: [Blue] ~23 levels ~491520 states ~2976896 transitions
pins2lts-mc-linux64( 3/ 8), 21.479: [Blue] ~24 levels ~983040 states ~6294768 transitions
pins2lts-mc-linux64( 2/ 8), 41.117: [Blue] ~24 levels ~1966080 states ~13837888 transitions
pins2lts-mc-linux64( 2/ 8), 79.825: [Blue] ~24 levels ~3932160 states ~27722120 transitions
pins2lts-mc-linux64( 3/ 8), 158.290: [Blue] ~25 levels ~7864320 states ~56322216 transitions
pins2lts-mc-linux64( 1/ 8), 317.471: [Blue] ~25 levels ~15728640 states ~115508112 transitions
pins2lts-mc-linux64( 7/ 8), 351.028: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 351.103:
pins2lts-mc-linux64( 0/ 8), 351.103: Explored 15965661 states 124934913 transitions, fanout: 7.825
pins2lts-mc-linux64( 0/ 8), 351.103: Total exploration time 350.890 sec (350.820 sec minimum, 350.859 sec on average)
pins2lts-mc-linux64( 0/ 8), 351.104: States per second: 45500, Transitions per second: 356052
pins2lts-mc-linux64( 0/ 8), 351.104:
pins2lts-mc-linux64( 0/ 8), 351.104: State space has 15965071 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 351.104: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 351.104: blue states: 15965661 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 351.104: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 351.104: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 351.104:
pins2lts-mc-linux64( 0/ 8), 351.104: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 351.104:
pins2lts-mc-linux64( 0/ 8), 351.104: Queue width: 8B, total height: 200, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 351.104: Tree memory: 377.8MB, 24.8 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 351.104: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 351.104: Stored 331 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 351.104: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 351.104: Est. total memory use: 377.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2999212542030528946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2999212542030528946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp2==true) U X(X([](((LTLAPp2==true)||X([]((<>([]((LTLAPp3==true))) U (LTLAPp4==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 00:59:46] [INFO ] Flatten gal took : 300 ms
[2024-05-27 00:59:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality10622964297485594398.gal : 47 ms
[2024-05-27 00:59:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality6844782939836204197.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10622964297485594398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6844782939836204197.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
Detected timeout of ITS tools.
[2024-05-27 01:22:50] [INFO ] Flatten gal took : 284 ms
[2024-05-27 01:22:52] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-27 01:22:52] [INFO ] Transformed 1397 places.
[2024-05-27 01:22:52] [INFO ] Transformed 296 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 01:22:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality14411877906299048428.gal : 9 ms
[2024-05-27 01:22:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality5679465495405812884.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14411877906299048428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5679465495405812884.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("(AstopOK>=1)")U(X(X(G(("(AstopOK>=1)")||(X(G((F(G("((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8...617
Formula 0 simplified : !"(AstopOK>=1)" R XXF(!"(AstopOK>=1)" & XF(GF!"((((((s6_1+s6_0)+(s6_3+s6_2))+((s6_5+s6_4)+(s6_7+s6_6)))+(((s6_10+s6_11)+(s6_8+s6_9))...601
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8872292 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15995464 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-18, 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 r329-tall-171662361400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;