Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838851000851.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r165-tall-167838851000851
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 10:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679594372740

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=itstools
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 202303021504
[2023-03-23 17:59:34] [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]
[2023-03-23 17:59:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:59:34] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-23 17:59:34] [INFO ] Transformed 33 places.
[2023-03-23 17:59:34] [INFO ] Transformed 22 transitions.
[2023-03-23 17:59:34] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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
[2023-03-23 17:59:34] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-23 17:59:34] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
[2023-03-23 17:59:34] [INFO ] Invariant cache hit.
[2023-03-23 17:59:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-23 17:59:34] [INFO ] Invariant cache hit.
[2023-03-23 17:59:34] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-23 17:59:34] [INFO ] Invariant cache hit.
[2023-03-23 17:59:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 26 out of 33 places after structural reductions.
[2023-03-23 17:59:34] [INFO ] Flatten gal took : 17 ms
[2023-03-23 17:59:34] [INFO ] Flatten gal took : 5 ms
[2023-03-23 17:59:34] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10041 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=122 ) properties (out of 31) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 17:59:35] [INFO ] Invariant cache hit.
[2023-03-23 17:59:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 17:59:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-23 17:59:35] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 17:59:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:59:35] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-23 17:59:38] [INFO ] After 3747ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 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 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 17:59:39] [INFO ] Invariant cache hit.
[2023-03-23 17:59:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-23 17:59:39] [INFO ] Invariant cache hit.
[2023-03-23 17:59:39] [INFO ] Implicit Places using invariants in 42 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 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 84 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), true, (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 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s16 s3), p0:(AND (LEQ 3 s17) (LEQ s16 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4804 steps with 1 reset in 29 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-01 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F(X(G(G((X(p0) U p1))))))))))'
Support contains 3 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 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 17:59:39] [INFO ] Invariant cache hit.
[2023-03-23 17:59:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-23 17:59:39] [INFO ] Invariant cache hit.
[2023-03-23 17:59:39] [INFO ] Implicit Places using invariants in 45 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 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 0 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 82 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
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 p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s6 s27), p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1732 reset in 196 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 71 in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-02 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 13 place count 25 transition count 16
Applied a total of 13 rules in 12 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 17:59:39] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 17:59:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 17:59:40] [INFO ] Invariant cache hit.
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants in 41 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 16/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 13
Applied a total of 7 rules in 6 ms. Remains 19 /23 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2023-03-23 17:59:40] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-23 17:59:40] [INFO ] Invariant cache hit.
[2023-03-23 17:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 19/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 110 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-03 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 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 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 17:59:40] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 17:59:40] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-23 17:59:40] [INFO ] Invariant cache hit.
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants in 37 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 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 86 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s23 s17), p1:(LEQ s3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-04 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 13 place count 25 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 9 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-23 17:59:40] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-23 17:59:40] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 17:59:40] [INFO ] Invariant cache hit.
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants in 29 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 15/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 13
Applied a total of 4 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 17:59:40] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-23 17:59:40] [INFO ] Invariant cache hit.
[2023-03-23 17:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 13/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 134 ms. Remains : 18/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-05 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(G(p1))))))'
Support contains 3 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 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 17:59:40] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 17:59:40] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-23 17:59:40] [INFO ] Invariant cache hit.
[2023-03-23 17:59:40] [INFO ] Implicit Places using invariants in 33 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 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 66 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s24), p1:(LEQ s18 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1900 steps with 0 reset in 7 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-07 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
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 8 place count 28 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 2 with 2 rules applied. Total rules applied 10 place count 27 transition count 17
Applied a total of 10 rules in 7 ms. Remains 27 /33 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2023-03-23 17:59:41] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-23 17:59:41] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-23 17:59:41] [INFO ] Invariant cache hit.
[2023-03-23 17:59:41] [INFO ] Implicit Places using invariants in 34 ms returned [3, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 17/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 15
Applied a total of 4 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-23 17:59:41] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 17:59:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 17:59:41] [INFO ] Invariant cache hit.
[2023-03-23 17:59:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 142 ms. Remains : 21/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-08 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s13 s1), p1:(LEQ 1 s10)], 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 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-08 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 13 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 17:59:41] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-23 17:59:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-23 17:59:41] [INFO ] Invariant cache hit.
[2023-03-23 17:59:41] [INFO ] Implicit Places using invariants in 26 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 16/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 13
Applied a total of 7 rules in 2 ms. Remains 19 /23 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2023-03-23 17:59:41] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 17:59:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-23 17:59:41] [INFO ] Invariant cache hit.
[2023-03-23 17:59:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 19/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 73 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 1 s0) (LEQ 3 s8))], 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 169 reset in 148 ms.
Product exploration explored 100000 steps with 165 reset in 130 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 135 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 68 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 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 157 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-23 17:59:42] [INFO ] Invariant cache hit.
[2023-03-23 17:59:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 17:59:42] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 17:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:59:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-23 17:59:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:59:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 17:59:42] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 17:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:59:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-23 17:59:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 17:59:42] [INFO ] Computed and/alt/rep : 12/28/12 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 17:59:42] [INFO ] Added : 0 causal constraints over 0 iterations in 5 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 0 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-23 17:59:42] [INFO ] Invariant cache hit.
[2023-03-23 17:59:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-23 17:59:42] [INFO ] Invariant cache hit.
[2023-03-23 17:59:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 17:59:42] [INFO ] Invariant cache hit.
[2023-03-23 17:59:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:42] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-23 17:59:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 17:59:42] [INFO ] Invariant cache hit.
[2023-03-23 17:59:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 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 110 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 74 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 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-23 17:59:43] [INFO ] Invariant cache hit.
[2023-03-23 17:59:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 17:59:43] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 17:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:59:43] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-23 17:59:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:59:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 17:59:43] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 17:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:59:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-23 17:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 17:59:43] [INFO ] Computed and/alt/rep : 12/28/12 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 17:59:43] [INFO ] Added : 0 causal constraints over 0 iterations in 5 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 142 reset in 101 ms.
Product exploration explored 100000 steps with 156 reset in 103 ms.
Built C files in :
/tmp/ltsmin14383286336223364962
[2023-03-23 17:59:43] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2023-03-23 17:59:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 17:59:43] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2023-03-23 17:59:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 17:59:43] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2023-03-23 17:59:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 17:59:43] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14383286336223364962
Running compilation step : cd /tmp/ltsmin14383286336223364962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin14383286336223364962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14383286336223364962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12203057536007718621.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 9 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-23 17:59:58] [INFO ] Invariant cache hit.
[2023-03-23 17:59:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-23 17:59:58] [INFO ] Invariant cache hit.
[2023-03-23 17:59:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-23 17:59:58] [INFO ] Invariant cache hit.
[2023-03-23 17:59:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 17:59:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-23 17:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 17:59:58] [INFO ] Invariant cache hit.
[2023-03-23 17:59:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 19/19 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin6002371298798471290
[2023-03-23 17:59:58] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2023-03-23 17:59:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 17:59:58] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2023-03-23 17:59:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 17:59:58] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2023-03-23 17:59:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 17:59:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6002371298798471290
Running compilation step : cd /tmp/ltsmin6002371298798471290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin6002371298798471290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6002371298798471290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12457560686126039403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 18:00:13] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:00:13] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:00:13] [INFO ] Time to serialize gal into /tmp/LTL16568389938015740996.gal : 1 ms
[2023-03-23 18:00:13] [INFO ] Time to serialize properties into /tmp/LTL8704292113728608597.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16568389938015740996.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1262700677871245484.hoa' '-atoms' '/tmp/LTL8704292113728608597.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8704292113728608597.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1262700677871245484.hoa
Detected timeout of ITS tools.
[2023-03-23 18:00:28] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:00:28] [INFO ] Flatten gal took : 1 ms
[2023-03-23 18:00:28] [INFO ] Time to serialize gal into /tmp/LTL9252107687674279818.gal : 0 ms
[2023-03-23 18:00:28] [INFO ] Time to serialize properties into /tmp/LTL2932306208581961975.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9252107687674279818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2932306208581961975.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((Pi>=1)||(G6P>=3))"))))
Formula 0 simplified : FG!"((Pi>=1)||(G6P>=3))"
Detected timeout of ITS tools.
[2023-03-23 18:00:43] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:00:43] [INFO ] Applying decomposition
[2023-03-23 18:00:43] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph429461390255659997.txt' '-o' '/tmp/graph429461390255659997.bin' '-w' '/tmp/graph429461390255659997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph429461390255659997.bin' '-l' '-1' '-v' '-w' '/tmp/graph429461390255659997.weights' '-q' '0' '-e' '0.001'
[2023-03-23 18:00:43] [INFO ] Decomposing Gal with order
[2023-03-23 18:00:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 18:00:43] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-23 18:00:43] [INFO ] Flatten gal took : 29 ms
[2023-03-23 18:00:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-23 18:00:43] [INFO ] Time to serialize gal into /tmp/LTL8492341814560304152.gal : 1 ms
[2023-03-23 18:00:43] [INFO ] Time to serialize properties into /tmp/LTL4160607249923375767.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8492341814560304152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4160607249923375767.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u1.Pi>=1)||(i1.u2.G6P>=3))"))))
Formula 0 simplified : FG!"((i1.u1.Pi>=1)||(i1.u2.G6P>=3))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15409292853456205853
[2023-03-23 18:00:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15409292853456205853
Running compilation step : cd /tmp/ltsmin15409292853456205853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin15409292853456205853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15409292853456205853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 92784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)||F(p2)||p0) U p3))'
Support contains 2 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 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 18:01:14] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 18:01:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-23 18:01:14] [INFO ] Invariant cache hit.
[2023-03-23 18:01:14] [INFO ] Implicit Places using invariants in 31 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 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 0 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 75 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ 1 s30), p0:(OR (LEQ 2 s7) (LEQ 1 s30)), p2:(GT 2 s7), p1:(OR (LEQ 2 s7) (GT 1 s30))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2616 reset in 202 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-11 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 13 place count 25 transition count 16
Applied a total of 13 rules in 8 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 18:01:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 18:01:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-23 18:01:14] [INFO ] Invariant cache hit.
[2023-03-23 18:01:14] [INFO ] Implicit Places using invariants in 26 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 16/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 24/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s16), p1:(AND (LEQ s18 s12) (LEQ 3 s18))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-12 finished in 120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U G(!p0)))'
Support contains 3 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 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 18:01:14] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-23 18:01:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 18:01:14] [INFO ] Invariant cache hit.
[2023-03-23 18:01:14] [INFO ] Implicit Places using invariants in 33 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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 66 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 281 ms :[p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s25 s29), p1:(LEQ 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-13 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 13 place count 25 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 10 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-23 18:01:15] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-23 18:01:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 18:01:15] [INFO ] Invariant cache hit.
[2023-03-23 18:01:15] [INFO ] Implicit Places using invariants in 28 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 15/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 18 transition count 12
Applied a total of 7 rules in 1 ms. Remains 18 /22 variables (removed 4) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 18:01:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 18:01:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-23 18:01:15] [INFO ] Invariant cache hit.
[2023-03-23 18:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:01:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 12/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 123 ms. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s4), p1:(LEQ 3 s6)], 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 11 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-14 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)||X((G(p2)||(p2&&F(!p0))))))'
Support contains 5 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 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 18:01:15] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 18:01:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-23 18:01:15] [INFO ] Invariant cache hit.
[2023-03-23 18:01:15] [INFO ] Implicit Places using invariants in 29 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LEQ s1 s15), p0:(LEQ s30 s31), p2:(GT 2 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, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 96 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) (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000100-LTLCardinality-15 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-23 18:01:16] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3635862283751624118
[2023-03-23 18:01:16] [INFO ] Applying decomposition
[2023-03-23 18:01:16] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2023-03-23 18:01:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 18:01:16] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:01:16] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2023-03-23 18:01:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 18:01:16] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2023-03-23 18:01:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 18:01:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3635862283751624118
Running compilation step : cd /tmp/ltsmin3635862283751624118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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.202303021504/bin/convert-linux64' '-i' '/tmp/graph9800479147316996026.txt' '-o' '/tmp/graph9800479147316996026.bin' '-w' '/tmp/graph9800479147316996026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9800479147316996026.bin' '-l' '-1' '-v' '-w' '/tmp/graph9800479147316996026.weights' '-q' '0' '-e' '0.001'
[2023-03-23 18:01:16] [INFO ] Decomposing Gal with order
[2023-03-23 18:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 18:01:16] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-23 18:01:16] [INFO ] Flatten gal took : 5 ms
[2023-03-23 18:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-23 18:01:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality9375509827580352790.gal : 1 ms
[2023-03-23 18:01:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality8471595542662159097.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9375509827580352790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8471595542662159097.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u6.Pi>=1)||(u7.G6P>=3))"))))
Formula 0 simplified : FG!"((i2.u6.Pi>=1)||(u7.G6P>=3))"
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin3635862283751624118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3635862283751624118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.001: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Initializing POR dependencies: labels 23, guards 22
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.011: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.016: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.016: State length is 34, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.016: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.016: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.016: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.016: Visible groups: 0 / 25, labels: 1 / 25
pins2lts-mc-linux64( 0/ 8), 0.016: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.016: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.042: [Blue] ~119 levels ~960 states ~1584 transitions
pins2lts-mc-linux64( 4/ 8), 0.060: [Blue] ~240 levels ~1920 states ~3336 transitions
pins2lts-mc-linux64( 0/ 8), 0.091: [Blue] ~479 levels ~3840 states ~6864 transitions
pins2lts-mc-linux64( 0/ 8), 0.147: [Blue] ~959 levels ~7680 states ~14472 transitions
pins2lts-mc-linux64( 3/ 8), 0.264: [Blue] ~1920 levels ~15360 states ~24400 transitions
pins2lts-mc-linux64( 3/ 8), 0.358: [Blue] ~2904 levels ~30720 states ~42560 transitions
pins2lts-mc-linux64( 5/ 8), 0.498: [Blue] ~2865 levels ~61440 states ~83472 transitions
pins2lts-mc-linux64( 5/ 8), 0.709: [Blue] ~2865 levels ~122880 states ~169096 transitions
pins2lts-mc-linux64( 5/ 8), 1.084: [Blue] ~2865 levels ~245760 states ~340488 transitions
pins2lts-mc-linux64( 5/ 8), 1.616: [Blue] ~2865 levels ~491520 states ~683584 transitions
pins2lts-mc-linux64( 5/ 8), 2.267: [Blue] ~2865 levels ~983040 states ~1370184 transitions
pins2lts-mc-linux64( 5/ 8), 3.178: [Blue] ~2865 levels ~1966080 states ~2743928 transitions
pins2lts-mc-linux64( 5/ 8), 4.725: [Blue] ~2865 levels ~3932160 states ~5492560 transitions
pins2lts-mc-linux64( 5/ 8), 8.036: [Blue] ~2865 levels ~7864320 states ~11146728 transitions
pins2lts-mc-linux64( 5/ 8), 15.070: [Blue] ~2865 levels ~15728640 states ~22942392 transitions
pins2lts-mc-linux64( 5/ 8), 28.711: [Blue] ~2865 levels ~31457280 states ~45744000 transitions
pins2lts-mc-linux64( 5/ 8), 61.971: [Blue] ~3045 levels ~62914560 states ~90003608 transitions
pins2lts-mc-linux64( 4/ 8), 74.352: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 74.448:
pins2lts-mc-linux64( 0/ 8), 74.448: Explored 59981180 states 75762861 transitions, fanout: 1.263
pins2lts-mc-linux64( 0/ 8), 74.448: Total exploration time 74.390 sec (74.290 sec minimum, 74.327 sec on average)
pins2lts-mc-linux64( 0/ 8), 74.448: States per second: 806307, Transitions per second: 1018455
pins2lts-mc-linux64( 0/ 8), 74.448:
pins2lts-mc-linux64( 0/ 8), 74.448: State space has 59383524 states, 1 are accepting
pins2lts-mc-linux64( 0/ 8), 74.448: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 74.448: blue states: 59981180 (101.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 74.448: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 74.448: all-red states: 1 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 74.448:
pins2lts-mc-linux64( 0/ 8), 74.448: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 74.448:
pins2lts-mc-linux64( 0/ 8), 74.448: Queue width: 8B, total height: 29246, memory: 0.22MB
pins2lts-mc-linux64( 0/ 8), 74.448: Tree memory: 709.1MB, 12.5 B/state, compr.: 9.1%
pins2lts-mc-linux64( 0/ 8), 74.448: Tree fill ratio (roots/leafs): 44.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 74.448: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 74.448: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 74.448: Est. total memory use: 709.3MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3635862283751624118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3635862283751624118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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.
[2023-03-23 18:21:50] [INFO ] Flatten gal took : 14 ms
[2023-03-23 18:21:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality930832315726436640.gal : 1 ms
[2023-03-23 18:21:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality1038047007829243663.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality930832315726436640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1038047007829243663.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((G(F("((Pi>=1)||(G6P>=3))"))))
Formula 0 simplified : FG!"((Pi>=1)||(G6P>=3))"
Detected timeout of ITS tools.
[2023-03-23 18:42:41] [INFO ] Flatten gal took : 208 ms
[2023-03-23 18:42:42] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-23 18:42:42] [INFO ] Transformed 33 places.
[2023-03-23 18:42:42] [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
[2023-03-23 18:42:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality18126319420549325659.gal : 6 ms
[2023-03-23 18:42:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality9102618726065065044.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18126319420549325659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9102618726065065044.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((Pi>=1)||(G6P>=3))"))))
Formula 0 simplified : FG!"((Pi>=1)||(G6P>=3))"
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
Computing Next relation with stutter on 1 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11187860 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15897904 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r165-tall-167838851000851"
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 ;