fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r197-tall-171640625200257
Last Updated
July 7, 2024

About the Execution of 2023-gold for GPPP-PT-C0100N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.172 3600000.00 3699173.00 231711.70 FTFFTTTFT?FFF?TF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625200257.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 GPPP-PT-C0100N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Apr 12 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716545859866

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=GPPP-PT-C0100N0000000100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 10:17: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-24 10:17:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 10:17:41] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-24 10:17:41] [INFO ] Transformed 33 places.
[2024-05-24 10:17:41] [INFO ] Transformed 22 transitions.
[2024-05-24 10:17:41] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 10:17:41] [INFO ] Computed 12 invariants in 17 ms
[2024-05-24 10:17:41] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
[2024-05-24 10:17:41] [INFO ] Invariant cache hit.
[2024-05-24 10:17:41] [INFO ] Implicit Places using invariants in 57 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 31/33 places, 22/22 transitions.
Support contains 21 out of 31 places after structural reductions.
[2024-05-24 10:17:42] [INFO ] Flatten gal took : 15 ms
[2024-05-24 10:17:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 10:17:42] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10016 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 10:17:42] [INFO ] Computed 10 invariants in 5 ms
[2024-05-24 10:17:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 10:17:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-24 10:17:42] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:42] [INFO ] After 56ms 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.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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(G(p0))||G(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:17:42] [INFO ] Invariant cache hit.
[2024-05-24 10:17:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 10:17:42] [INFO ] Invariant cache hit.
[2024-05-24 10:17:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 10:17:42] [INFO ] Invariant cache hit.
[2024-05-24 10:17:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 30/31 places, 22/22 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 258 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT s27 s17), p0:(GT s15 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2919 steps with 0 reset in 23 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-00 finished in 449 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&&X(p0)&&(p1 U (p2||G(p1))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:17:43] [INFO ] Invariant cache hit.
[2024-05-24 10:17:43] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-24 10:17:43] [INFO ] Invariant cache hit.
[2024-05-24 10:17:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 10:17:43] [INFO ] Invariant cache hit.
[2024-05-24 10:17:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s24 s22), p2:(AND (GT 1 s11) (LEQ 2 s28)), p1:(LEQ 2 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-01 finished in 709 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 22 transition count 14
Applied a total of 16 rules in 21 ms. Remains 22 /31 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-24 10:17:43] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 10:17:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-24 10:17:43] [INFO ] Invariant cache hit.
[2024-05-24 10:17:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 10:17:43] [INFO ] Invariant cache hit.
[2024-05-24 10:17:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:17:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 21/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-02 finished in 220 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(G(p0))&&F(p1))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 23 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 20 transition count 14
Applied a total of 19 rules in 7 ms. Remains 20 /31 variables (removed 11) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2024-05-24 10:17:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 10:17:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 10:17:43] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 10:17:44] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 19/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s10), p1:(LEQ s10 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1254 steps with 0 reset in 11 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-03 finished in 244 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||X(F(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 10:17:44] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:17:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 10:17:44] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 10:17:44] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s21 s25), p1:(LEQ 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-04 finished in 458 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(F(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 10:17:44] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 10:17:44] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 10:17:44] [INFO ] Invariant cache hit.
[2024-05-24 10:17:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s25 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-06 finished in 343 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)&&F(p1))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 22 transition count 14
Applied a total of 16 rules in 6 ms. Remains 22 /31 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-24 10:17:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 10:17:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-24 10:17:45] [INFO ] Invariant cache hit.
[2024-05-24 10:17:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 10:17:45] [INFO ] Invariant cache hit.
[2024-05-24 10:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:17:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 21/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s4), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-07 finished in 236 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 21 transition count 14
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 19 transition count 13
Applied a total of 20 rules in 5 ms. Remains 19 /31 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-24 10:17:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 10:17:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-24 10:17:45] [INFO ] Invariant cache hit.
[2024-05-24 10:17:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 10:17:45] [INFO ] Invariant cache hit.
[2024-05-24 10:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:17:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 10:17:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 10:17:45] [INFO ] Invariant cache hit.
[2024-05-24 10:17:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 19/31 places, 13/22 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s8) (LEQ 1 s0))], 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 158 reset in 79 ms.
Product exploration explored 100000 steps with 176 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-05-24 10:17:46] [INFO ] Invariant cache hit.
[2024-05-24 10:17:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 10:17:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 10:17:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:17:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 10:17:46] [INFO ] Computed and/alt/rep : 12/28/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 10:17:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-24 10:17:46] [INFO ] Invariant cache hit.
[2024-05-24 10:17:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-24 10:17:46] [INFO ] Invariant cache hit.
[2024-05-24 10:17:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 10:17:46] [INFO ] Invariant cache hit.
[2024-05-24 10:17:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:17:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-24 10:17:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 10:17:46] [INFO ] Invariant cache hit.
[2024-05-24 10:17:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 19/19 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 75 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-24 10:17:46] [INFO ] Invariant cache hit.
[2024-05-24 10:17:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 10:17:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 10:17:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 10:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 10:17:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 10:17:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:17:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 10:17:46] [INFO ] Computed and/alt/rep : 12/28/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 10:17:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 169 reset in 89 ms.
Product exploration explored 100000 steps with 174 reset in 93 ms.
Built C files in :
/tmp/ltsmin1996424727915387635
[2024-05-24 10:17:47] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-24 10:17:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:17:47] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-24 10:17:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:17:47] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-24 10:17:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:17:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1996424727915387635
Running compilation step : cd /tmp/ltsmin1996424727915387635;'/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 190 ms.
Running link step : cd /tmp/ltsmin1996424727915387635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1996424727915387635;'/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/stateBased50118722856475674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 13/13 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-24 10:18:02] [INFO ] Invariant cache hit.
[2024-05-24 10:18:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-24 10:18:02] [INFO ] Invariant cache hit.
[2024-05-24 10:18:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 10:18:02] [INFO ] Invariant cache hit.
[2024-05-24 10:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:18:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 10:18:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 10:18:02] [INFO ] Invariant cache hit.
[2024-05-24 10:18:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 19/19 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin15019623255265339349
[2024-05-24 10:18:02] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-24 10:18:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:18:02] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-24 10:18:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:18:02] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-24 10:18:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:18:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15019623255265339349
Running compilation step : cd /tmp/ltsmin15019623255265339349;'/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 90 ms.
Running link step : cd /tmp/ltsmin15019623255265339349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15019623255265339349;'/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/stateBased6751352367901051286.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 10:18:17] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:18:17] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:18:17] [INFO ] Time to serialize gal into /tmp/LTL10080932006034342530.gal : 1 ms
[2024-05-24 10:18:17] [INFO ] Time to serialize properties into /tmp/LTL209016947955233037.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/LTL10080932006034342530.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10013123144100643202.hoa' '-atoms' '/tmp/LTL209016947955233037.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/LTL209016947955233037.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10013123144100643202.hoa
Detected timeout of ITS tools.
[2024-05-24 10:18:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:18:32] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:18:32] [INFO ] Time to serialize gal into /tmp/LTL1966833714816988255.gal : 1 ms
[2024-05-24 10:18:32] [INFO ] Time to serialize properties into /tmp/LTL18177884367462722565.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/LTL1966833714816988255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18177884367462722565.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 : !((G(F("((G6P>=3)||(Pi>=1))"))))
Formula 0 simplified : FG!"((G6P>=3)||(Pi>=1))"
Detected timeout of ITS tools.
[2024-05-24 10:18:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 10:18:47] [INFO ] Applying decomposition
[2024-05-24 10:18:47] [INFO ] Flatten gal took : 4 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/graph3384101744125706891.txt' '-o' '/tmp/graph3384101744125706891.bin' '-w' '/tmp/graph3384101744125706891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3384101744125706891.bin' '-l' '-1' '-v' '-w' '/tmp/graph3384101744125706891.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:18:47] [INFO ] Decomposing Gal with order
[2024-05-24 10:18:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:18:47] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-24 10:18:47] [INFO ] Flatten gal took : 22 ms
[2024-05-24 10:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 10:18:47] [INFO ] Time to serialize gal into /tmp/LTL8981286996420809680.gal : 1 ms
[2024-05-24 10:18:47] [INFO ] Time to serialize properties into /tmp/LTL9192494196712932028.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/LTL8981286996420809680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9192494196712932028.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u2.G6P>=3)||(i0.u1.Pi>=1))"))))
Formula 0 simplified : FG!"((i0.u2.G6P>=3)||(i0.u1.Pi>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8028570707840906564
[2024-05-24 10:19:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8028570707840906564
Running compilation step : cd /tmp/ltsmin8028570707840906564;'/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 81 ms.
Running link step : cd /tmp/ltsmin8028570707840906564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8028570707840906564;'/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 GPPP-PT-C0100N0000000100-LTLCardinality-09 finished in 92669 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(G(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 10:19:17] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 10:19:17] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
[2024-05-24 10:19:17] [INFO ] Invariant cache hit.
[2024-05-24 10:19:17] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 10:19:17] [INFO ] Invariant cache hit.
[2024-05-24 10:19:18] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s25)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-10 finished in 325 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 U (G(p0)||(G(p2)&&p1))))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 29 transition count 20
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 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 19
Applied a total of 6 rules in 7 ms. Remains 28 /31 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2024-05-24 10:19:18] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:19:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 10:19:18] [INFO ] Invariant cache hit.
[2024-05-24 10:19:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 10:19:18] [INFO ] Invariant cache hit.
[2024-05-24 10:19:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/31 places, 19/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 27/31 places, 19/22 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT s26 s17) (GT s4 s11)), p2:(LEQ s20 s10), p0:(GT s4 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 34 reset in 141 ms.
Product exploration explored 100000 steps with 34 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 297 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10076 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1119 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 19 rows 27 cols
[2024-05-24 10:19:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 10:19:19] [INFO ] After 31ms SMT Verify possible using all constraints in real 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 (NOT p1) p2 p0), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND p0 p2 p1)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 18 factoid took 636 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 19/19 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-24 10:19:20] [INFO ] Invariant cache hit.
[2024-05-24 10:19:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 10:19:20] [INFO ] Invariant cache hit.
[2024-05-24 10:19:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 10:19:20] [INFO ] Invariant cache hit.
[2024-05-24 10:19:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 10:19:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 10:19:20] [INFO ] Invariant cache hit.
[2024-05-24 10:19:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 27/27 places, 19/19 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 137 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10027 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=716 ) properties (out of 8) seen :7
Finished Best-First random walk after 1877 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=625 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND p2 p0 p1)), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1))))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 11 factoid took 370 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 34 reset in 114 ms.
Product exploration explored 100000 steps with 34 reset in 123 ms.
Built C files in :
/tmp/ltsmin12433678966046408430
[2024-05-24 10:19:21] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2024-05-24 10:19:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:19:21] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2024-05-24 10:19:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:19:21] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2024-05-24 10:19:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:19:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12433678966046408430
Running compilation step : cd /tmp/ltsmin12433678966046408430;'/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 97 ms.
Running link step : cd /tmp/ltsmin12433678966046408430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12433678966046408430;'/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/stateBased13119449684582449272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 19/19 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-24 10:19:36] [INFO ] Invariant cache hit.
[2024-05-24 10:19:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 10:19:36] [INFO ] Invariant cache hit.
[2024-05-24 10:19:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 10:19:36] [INFO ] Invariant cache hit.
[2024-05-24 10:19:36] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 10:19:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 10:19:36] [INFO ] Invariant cache hit.
[2024-05-24 10:19:36] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 27/27 places, 19/19 transitions.
Built C files in :
/tmp/ltsmin10785180774095758331
[2024-05-24 10:19:36] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2024-05-24 10:19:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:19:36] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2024-05-24 10:19:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:19:36] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2024-05-24 10:19:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:19:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10785180774095758331
Running compilation step : cd /tmp/ltsmin10785180774095758331;'/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 80 ms.
Running link step : cd /tmp/ltsmin10785180774095758331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10785180774095758331;'/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/stateBased6932794256719512902.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 10:19:52] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:19:52] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:19:52] [INFO ] Time to serialize gal into /tmp/LTL10149168909301540135.gal : 1 ms
[2024-05-24 10:19:52] [INFO ] Time to serialize properties into /tmp/LTL10180571188736298554.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/LTL10149168909301540135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13723376380194383587.hoa' '-atoms' '/tmp/LTL10180571188736298554.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/LTL10180571188736298554.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13723376380194383587.hoa
Detected timeout of ITS tools.
[2024-05-24 10:20:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:20:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:20:07] [INFO ] Time to serialize gal into /tmp/LTL15536009108791333560.gal : 1 ms
[2024-05-24 10:20:07] [INFO ] Time to serialize properties into /tmp/LTL11147843358933131623.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/LTL15536009108791333560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11147843358933131623.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(GSSG>E4P)")U((G("(GSSG>E4P)"))||(("((c2>Pyr)&&(GSSG>E4P))")&&(G("(Gluc<=GAP)"))))))))
Formula 0 simplified : FG(!"(GSSG>E4P)" M (!"((c2>Pyr)&&(GSSG>E4P))" | F!"(Gluc<=GAP)"))
Detected timeout of ITS tools.
[2024-05-24 10:20:22] [INFO ] Flatten gal took : 4 ms
[2024-05-24 10:20:22] [INFO ] Applying decomposition
[2024-05-24 10:20:22] [INFO ] Flatten gal took : 2 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/graph9018979876311627089.txt' '-o' '/tmp/graph9018979876311627089.bin' '-w' '/tmp/graph9018979876311627089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9018979876311627089.bin' '-l' '-1' '-v' '-w' '/tmp/graph9018979876311627089.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:20:22] [INFO ] Decomposing Gal with order
[2024-05-24 10:20:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:20:22] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-24 10:20:22] [INFO ] Flatten gal took : 4 ms
[2024-05-24 10:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 10:20:22] [INFO ] Time to serialize gal into /tmp/LTL13778638648362234402.gal : 1 ms
[2024-05-24 10:20:22] [INFO ] Time to serialize properties into /tmp/LTL6285072330329578720.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/LTL13778638648362234402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6285072330329578720.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 : !((G(F(("(gu2.GSSG>gu2.E4P)")U((G("(gu2.GSSG>gu2.E4P)"))||(("((gu8.c2>gu8.Pyr)&&(gu2.GSSG>gu2.E4P))")&&(G("(gu5.Gluc<=gu5.GAP)")))))))...156
Formula 0 simplified : FG(!"(gu2.GSSG>gu2.E4P)" M (!"((gu8.c2>gu8.Pyr)&&(gu2.GSSG>gu2.E4P))" | F!"(gu5.Gluc<=gu5.GAP)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin398349569645868864
[2024-05-24 10:20:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin398349569645868864
Running compilation step : cd /tmp/ltsmin398349569645868864;'/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 93 ms.
Running link step : cd /tmp/ltsmin398349569645868864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin398349569645868864;'/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 ([]((LTLAPp0==true))||([]((LTLAPp2==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-13 finished in 94091 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(!X(X(F(!F(p0)))))||p1) U p2) U p1))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 28 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 27 transition count 18
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 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Applied a total of 9 rules in 4 ms. Remains 26 /31 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2024-05-24 10:20:52] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 10:20:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-24 10:20:52] [INFO ] Invariant cache hit.
[2024-05-24 10:20:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 10:20:52] [INFO ] Invariant cache hit.
[2024-05-24 10:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 10:20:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/31 places, 17/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 25/31 places, 17/22 transitions.
Stuttering acceptance computed with spot in 202 ms :[p1, true, (AND p1 p2 p0), p0, (AND p0 p1), (AND p0 p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s0), p2:(LEQ s1 s4), p0:(LEQ 2 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1813 steps with 0 reset in 4 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-15 finished in 340 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)))'
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 U (G(p0)||(G(p2)&&p1))))))'
[2024-05-24 10:20:52] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8644066357662750248
[2024-05-24 10:20:52] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-24 10:20:52] [INFO ] Applying decomposition
[2024-05-24 10:20:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:20:52] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-24 10:20:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:20:52] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-24 10:20:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 10:20:52] [INFO ] Flatten gal took : 2 ms
[2024-05-24 10:20:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8644066357662750248
Running compilation step : cd /tmp/ltsmin8644066357662750248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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/graph5986476159209927405.txt' '-o' '/tmp/graph5986476159209927405.bin' '-w' '/tmp/graph5986476159209927405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5986476159209927405.bin' '-l' '-1' '-v' '-w' '/tmp/graph5986476159209927405.weights' '-q' '0' '-e' '0.001'
[2024-05-24 10:20:52] [INFO ] Decomposing Gal with order
[2024-05-24 10:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 10:20:52] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-24 10:20:52] [INFO ] Flatten gal took : 3 ms
[2024-05-24 10:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 10:20:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality5368185181462811093.gal : 1 ms
[2024-05-24 10:20:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality7962639275836548800.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/LTLCardinality5368185181462811093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7962639275836548800.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...297
Read 2 LTL properties
Checking formula 0 : !((G(F("((gi0.gi0.gu0.G6P>=3)||(gi0.gi0.gu5.Pi>=1))"))))
Formula 0 simplified : FG!"((gi0.gi0.gu0.G6P>=3)||(gi0.gi0.gu5.Pi>=1))"
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin8644066357662750248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin8644066357662750248;'/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)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 26, guards 22
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.015: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.018: There are 28 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.018: State length is 32, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.018: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.018: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.018: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.018: Visible groups: 0 / 25, labels: 1 / 28
pins2lts-mc-linux64( 0/ 8), 0.018: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.018: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.031: [Blue] ~119 levels ~960 states ~1536 transitions
pins2lts-mc-linux64( 3/ 8), 0.050: [Blue] ~240 levels ~1920 states ~3824 transitions
pins2lts-mc-linux64( 3/ 8), 0.105: [Blue] ~480 levels ~3840 states ~7664 transitions
pins2lts-mc-linux64( 3/ 8), 0.202: [Blue] ~960 levels ~7680 states ~14584 transitions
pins2lts-mc-linux64( 2/ 8), 0.296: [Blue] ~1920 levels ~15360 states ~23160 transitions
pins2lts-mc-linux64( 3/ 8), 0.478: [Blue] ~3270 levels ~30720 states ~41528 transitions
pins2lts-mc-linux64( 3/ 8), 0.646: [Blue] ~3270 levels ~61440 states ~78224 transitions
pins2lts-mc-linux64( 3/ 8), 0.918: [Blue] ~3270 levels ~122880 states ~151760 transitions
pins2lts-mc-linux64( 3/ 8), 1.338: [Blue] ~3420 levels ~245760 states ~301848 transitions
pins2lts-mc-linux64( 3/ 8), 1.951: [Blue] ~3517 levels ~491520 states ~600976 transitions
pins2lts-mc-linux64( 1/ 8), 2.687: [Blue] ~3287 levels ~983040 states ~1170880 transitions
pins2lts-mc-linux64( 1/ 8), 3.695: [Blue] ~3287 levels ~1966080 states ~2341168 transitions
pins2lts-mc-linux64( 3/ 8), 5.426: [Blue] ~3705 levels ~3932160 states ~4700720 transitions
pins2lts-mc-linux64( 4/ 8), 9.311: [Blue] ~2861 levels ~7864320 states ~8513824 transitions
pins2lts-mc-linux64( 3/ 8), 16.943: [Blue] ~3705 levels ~15728640 states ~19273632 transitions
pins2lts-mc-linux64( 3/ 8), 33.000: [Blue] ~3705 levels ~31457280 states ~38998464 transitions
pins2lts-mc-linux64( 2/ 8), 39.101: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 39.157:
pins2lts-mc-linux64( 0/ 8), 39.157: Explored 32136943 states 37163862 transitions, fanout: 1.156
pins2lts-mc-linux64( 0/ 8), 39.157: Total exploration time 39.110 sec (39.030 sec minimum, 39.066 sec on average)
pins2lts-mc-linux64( 0/ 8), 39.157: States per second: 821707, Transitions per second: 950239
pins2lts-mc-linux64( 0/ 8), 39.157:
pins2lts-mc-linux64( 0/ 8), 39.157: State space has 31644049 states, 1 are accepting
pins2lts-mc-linux64( 0/ 8), 39.157: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 39.157: blue states: 32136943 (101.56%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 39.157: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 39.157: all-red states: 1 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 39.157:
pins2lts-mc-linux64( 0/ 8), 39.157: Total memory used for local state coloring: 0.6MB
pins2lts-mc-linux64( 0/ 8), 39.157:
pins2lts-mc-linux64( 0/ 8), 39.157: Queue width: 8B, total height: 38895, memory: 0.30MB
pins2lts-mc-linux64( 0/ 8), 39.157: Tree memory: 497.4MB, 16.5 B/state, compr.: 12.7%
pins2lts-mc-linux64( 0/ 8), 39.157: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 39.157: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 39.157: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 39.157: Est. total memory use: 497.7MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8644066357662750248;'/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)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8644066357662750248;'/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)))' '--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-24 10:41:56] [INFO ] Flatten gal took : 5 ms
[2024-05-24 10:41:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality3349031097257326506.gal : 0 ms
[2024-05-24 10:41:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality9304688718737510691.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/LTLCardinality3349031097257326506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9304688718737510691.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...297
Read 2 LTL properties
Checking formula 0 : !((G(F("((G6P>=3)||(Pi>=1))"))))
Formula 0 simplified : FG!"((G6P>=3)||(Pi>=1))"
Detected timeout of ITS tools.
[2024-05-24 11:03:06] [INFO ] Flatten gal took : 173 ms
[2024-05-24 11:03:07] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-24 11:03:07] [INFO ] Transformed 31 places.
[2024-05-24 11:03:07] [INFO ] Transformed 22 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-24 11:03:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality11151300893832091129.gal : 5 ms
[2024-05-24 11:03:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality15572093060789902702.ltl : 9 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/LTLCardinality11151300893832091129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15572093060789902702.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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((G6P>=3)||(Pi>=1))"))))
Formula 0 simplified : FG!"((G6P>=3)||(Pi>=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 4867416 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16070024 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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="GPPP-PT-C0100N0000000100"
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 GPPP-PT-C0100N0000000100, 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 r197-tall-171640625200257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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