Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 11 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716674336865

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-08000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 21:59:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:59:00] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-05-25 21:59:00] [INFO ] Transformed 26 places.
[2024-05-25 21:59:00] [INFO ] Transformed 18 transitions.
[2024-05-25 21:59:00] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Support contains 23 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 15 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-05-25 21:59:00] [INFO ] Computed 8 invariants in 12 ms
[2024-05-25 21:59:01] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-25 21:59:01] [INFO ] Invariant cache hit.
[2024-05-25 21:59:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-25 21:59:01] [INFO ] Invariant cache hit.
[2024-05-25 21:59:01] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 23 out of 26 places after structural reductions.
[2024-05-25 21:59:01] [INFO ] Flatten gal took : 36 ms
[2024-05-25 21:59:01] [INFO ] Flatten gal took : 11 ms
[2024-05-25 21:59:01] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16004 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=484 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 33) seen :23
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 21:59:01] [INFO ] Invariant cache hit.
[2024-05-25 21:59:02] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 21:59:02] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 21:59:02] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 21:59:02] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-25 21:59:02] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 13 ms returned sat
[2024-05-25 21:59:02] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 21:59:02] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-25 21:59:02] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 4 properties in 333 ms.
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X((p2&&X(F(p2)))))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 21:59:03] [INFO ] Computed 7 invariants in 3 ms
[2024-05-25 21:59:03] [INFO ] Implicit Places using invariants in 75 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 79 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 21/26 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s14), p1:(LEQ 1 s9), p2:(LEQ s2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 421 reset in 607 ms.
Product exploration explored 100000 steps with 1021 reset in 565 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 964 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-00 finished in 2779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p1))&&p0))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 21:59:06] [INFO ] Invariant cache hit.
[2024-05-25 21:59:06] [INFO ] Implicit Places using invariants in 50 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (LEQ s17 s14) (LEQ s3 s10)), p1:(AND (GT 2 s19) (GT 2 s3))], 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 10 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-01 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 21:59:06] [INFO ] Invariant cache hit.
[2024-05-25 21:59:06] [INFO ] Implicit Places using invariants in 55 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s13 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-02 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(X(p1))))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-25 21:59:06] [INFO ] Invariant cache hit.
[2024-05-25 21:59:06] [INFO ] Implicit Places using invariants in 54 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s8), p1:(LEQ 1 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3025 reset in 207 ms.
Product exploration explored 100000 steps with 2982 reset in 576 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 233 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=233 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 21:59:08] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 21:59:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-25 21:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:59:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 21:59:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:59:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 21:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:59:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 21:59:08] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:59:08] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 21:59:08] [INFO ] Invariant cache hit.
[2024-05-25 21:59:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 21:59:08] [INFO ] Invariant cache hit.
[2024-05-25 21:59:08] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-25 21:59:08] [INFO ] Invariant cache hit.
[2024-05-25 21:59:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=2286 ) properties (out of 1) seen :0
Finished Best-First random walk after 176 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=176 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-25 21:59:09] [INFO ] Invariant cache hit.
[2024-05-25 21:59:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:59:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-25 21:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:59:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 21:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:59:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 21:59:10] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 21:59:10] [INFO ] Added : 17 causal constraints over 4 iterations in 36 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2992 reset in 224 ms.
Product exploration explored 100000 steps with 2979 reset in 199 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 16 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 16 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 16 transition count 13
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 14 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 14 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 12 rules in 22 ms. Remains 14 /22 variables (removed 8) and now considering 11/18 (removed 7) transitions.
[2024-05-25 21:59:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2024-05-25 21:59:11] [INFO ] Computed 3 invariants in 2 ms
[2024-05-25 21:59:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 14/22 places, 11/18 transitions.
Built C files in :
/tmp/ltsmin9002431876816453955
[2024-05-25 21:59:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9002431876816453955
Running compilation step : cd /tmp/ltsmin9002431876816453955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 301 ms.
Running link step : cd /tmp/ltsmin9002431876816453955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin9002431876816453955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased736826992384386848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 21:59:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 21:59:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 21:59:26] [INFO ] Invariant cache hit.
[2024-05-25 21:59:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-25 21:59:26] [INFO ] Invariant cache hit.
[2024-05-25 21:59:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin12009997122789280177
[2024-05-25 21:59:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12009997122789280177
Running compilation step : cd /tmp/ltsmin12009997122789280177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin12009997122789280177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12009997122789280177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16190014396376494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 21:59:41] [INFO ] Flatten gal took : 4 ms
[2024-05-25 21:59:41] [INFO ] Flatten gal took : 3 ms
[2024-05-25 21:59:41] [INFO ] Time to serialize gal into /tmp/LTL17188114078738290486.gal : 5 ms
[2024-05-25 21:59:41] [INFO ] Time to serialize properties into /tmp/LTL6375174669579824800.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17188114078738290486.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10353192554314001822.hoa' '-atoms' '/tmp/LTL6375174669579824800.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(p12>=3)")||(X(X(X("(p21>=1)")))))))
Formula 0 simplified : G(!"(p12>=3)" & XXX!"(p21>=1)")
Detected timeout of ITS tools.
[2024-05-25 22:00:11] [INFO ] Flatten gal took : 2 ms
[2024-05-25 22:00:11] [INFO ] Applying decomposition
[2024-05-25 22:00:11] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8330397989107316682.txt' '-o' '/tmp/graph8330397989107316682.bin' '-w' '/tmp/graph8330397989107316682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8330397989107316682.bin' '-l' '-1' '-v' '-w' '/tmp/graph8330397989107316682.weights' '-q' '0' '-e' '0.001'
[2024-05-25 22:00:11] [INFO ] Decomposing Gal with order
[2024-05-25 22:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 22:00:11] [INFO ] Flatten gal took : 34 ms
[2024-05-25 22:00:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 22:00:11] [INFO ] Time to serialize gal into /tmp/LTL4129962808313306677.gal : 1 ms
[2024-05-25 22:00:11] [INFO ] Time to serialize properties into /tmp/LTL14367365835197123916.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4129962808313306677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14367365835197123916.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(u4.p12>=3)")||(X(X(X("(u6.p21>=1)")))))))
Formula 0 simplified : G(!"(u4.p12>=3)" & XXX!"(u6.p21>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13994085174936332564
[2024-05-25 22:00:26] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13994085174936332564
Running compilation step : cd /tmp/ltsmin13994085174936332564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin13994085174936332564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13994085174936332564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-03 finished in 95527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:00:42] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:00:42] [INFO ] Implicit Places using invariants in 48 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s11 s1) (LEQ s16 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-04 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 9 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 3 transition count 3
Applied a total of 10 rules in 811 ms. Remains 3 /26 variables (removed 23) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 22:00:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 22:00:43] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 22:00:43] [INFO ] Invariant cache hit.
[2024-05-25 22:00:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-25 22:00:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:00:43] [INFO ] Invariant cache hit.
[2024-05-25 22:00:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/26 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 879 ms. Remains : 3/26 places, 3/18 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s1 s2), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-05 finished in 975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:00:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:00:43] [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 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 24/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s13), p1:(GT s3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3024 reset in 157 ms.
Product exploration explored 100000 steps with 4259 reset in 275 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 266 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1778 ) properties (out of 4) seen :0
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 748 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 22:00:45] [INFO ] Computed 6 invariants in 8 ms
[2024-05-25 22:00:45] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-25 22:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-25 22:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:00:45] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-25 22:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 22:00:45] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 22:00:45] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 14 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 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 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 12 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 7 transition count 5
Applied a total of 11 rules in 802 ms. Remains 7 /24 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-25 22:00:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 22:00:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 22:00:46] [INFO ] Invariant cache hit.
[2024-05-25 22:00:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 22:00:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:00:46] [INFO ] Invariant cache hit.
[2024-05-25 22:00:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 878 ms. Remains : 7/24 places, 5/18 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 8 factoid took 524 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2667 ) properties (out of 4) seen :2
Finished Best-First random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 1027 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-05-25 22:00:49] [INFO ] Invariant cache hit.
[2024-05-25 22:00:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 22:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 22:00:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:00:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 22:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 22:00:49] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:00:49] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering criterion allowed to conclude after 71656 steps with 436 reset in 106 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-06 finished in 6311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:00:49] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:00:49] [INFO ] Implicit Places using invariants in 44 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 45 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT 3 s8), p0:(LEQ s16 s18)], 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 37 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-07 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 21 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 19 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 13 transition count 8
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 21 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 8 transition count 6
Applied a total of 26 rules in 1984 ms. Remains 8 /26 variables (removed 18) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 22:00:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 22:00:52] [INFO ] Implicit Places using invariants in 64 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2050 ms. Remains : 7/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 3 s6), p0:(GT s4 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 477 reset in 207 ms.
Product exploration explored 100000 steps with 1232 reset in 356 ms.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 503 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 229081 steps, run visited all 1 properties in 337 ms. (steps per millisecond=679 )
Probabilistic random walk after 229081 steps, saw 170647 distinct states, run finished after 338 ms. (steps per millisecond=677 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 13 factoid took 632 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 22:00:54] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 22:00:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 22:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 22:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:00:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 22:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 22:00:54] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:00:54] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-25 22:00:54] [INFO ] Invariant cache hit.
[2024-05-25 22:00:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 22:00:54] [INFO ] Invariant cache hit.
[2024-05-25 22:00:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 22:00:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:00:54] [INFO ] Invariant cache hit.
[2024-05-25 22:00:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 229081 steps, run visited all 1 properties in 354 ms. (steps per millisecond=647 )
Probabilistic random walk after 229081 steps, saw 170647 distinct states, run finished after 355 ms. (steps per millisecond=645 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-25 22:00:55] [INFO ] Invariant cache hit.
[2024-05-25 22:00:55] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 22:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 22:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:00:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 22:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:00:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 22:00:55] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 22:00:55] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 538 reset in 82 ms.
Product exploration explored 100000 steps with 337 reset in 110 ms.
Built C files in :
/tmp/ltsmin10127240011950119731
[2024-05-25 22:00:55] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 22:00:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:00:55] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 22:00:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:00:55] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 22:00:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:00:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10127240011950119731
Running compilation step : cd /tmp/ltsmin10127240011950119731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin10127240011950119731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10127240011950119731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15829236272370300906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5 transition count 4
Applied a total of 2 rules in 616 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 22:01:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 22:01:11] [INFO ] Implicit Places using invariants in 28 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/7 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 647 ms. Remains : 4/7 places, 4/6 transitions.
Built C files in :
/tmp/ltsmin15518413200413220927
[2024-05-25 22:01:11] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 22:01:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:01:11] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 22:01:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:01:11] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 22:01:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:01:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15518413200413220927
Running compilation step : cd /tmp/ltsmin15518413200413220927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin15518413200413220927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15518413200413220927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6397639724902972858.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 22:01:26] [INFO ] Flatten gal took : 1 ms
[2024-05-25 22:01:26] [INFO ] Flatten gal took : 0 ms
[2024-05-25 22:01:26] [INFO ] Time to serialize gal into /tmp/LTL3108858087613550076.gal : 1 ms
[2024-05-25 22:01:26] [INFO ] Time to serialize properties into /tmp/LTL5237336693056830151.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3108858087613550076.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6547912308437268727.hoa' '-atoms' '/tmp/LTL5237336693056830151.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5237336693056830151.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6547912308437268727.hoa
Detected timeout of ITS tools.
[2024-05-25 22:01:41] [INFO ] Flatten gal took : 1 ms
[2024-05-25 22:01:41] [INFO ] Flatten gal took : 0 ms
[2024-05-25 22:01:41] [INFO ] Time to serialize gal into /tmp/LTL10531308401338125547.gal : 1 ms
[2024-05-25 22:01:41] [INFO ] Time to serialize properties into /tmp/LTL7840836653535770313.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10531308401338125547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7840836653535770313.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p27>p19)"))&&(F("(p16<3)"))))
Formula 0 simplified : G!"(p27>p19)" | G!"(p16<3)"
Detected timeout of ITS tools.
[2024-05-25 22:01:56] [INFO ] Flatten gal took : 1 ms
[2024-05-25 22:01:56] [INFO ] Applying decomposition
[2024-05-25 22:01:56] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1181256551605222245.txt' '-o' '/tmp/graph1181256551605222245.bin' '-w' '/tmp/graph1181256551605222245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1181256551605222245.bin' '-l' '-1' '-v' '-w' '/tmp/graph1181256551605222245.weights' '-q' '0' '-e' '0.001'
[2024-05-25 22:01:56] [INFO ] Decomposing Gal with order
[2024-05-25 22:01:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 22:01:56] [INFO ] Flatten gal took : 1 ms
[2024-05-25 22:01:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 22:01:56] [INFO ] Time to serialize gal into /tmp/LTL13888750817687645817.gal : 1 ms
[2024-05-25 22:01:56] [INFO ] Time to serialize properties into /tmp/LTL7626029890661414520.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13888750817687645817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7626029890661414520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu1.p27>gu1.p19)"))&&(F("(gu0.p16<3)"))))
Formula 0 simplified : G!"(gu1.p27>gu1.p19)" | G!"(gu0.p16<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2562290818843606229
[2024-05-25 22:02:11] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2562290818843606229
Running compilation step : cd /tmp/ltsmin2562290818843606229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin2562290818843606229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2562290818843606229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-08 finished in 97101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&X(p1))) U !p1))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:02:27] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 22:02:27] [INFO ] Implicit Places using invariants in 53 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s6), p0:(GT 2 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 169 ms.
Product exploration explored 100000 steps with 66 reset in 195 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 562 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[p1, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=5334 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :5
Finished Best-First random walk after 542 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=271 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 1182 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[p1, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false]
Stuttering acceptance computed with spot in 281 ms :[p1, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 22:02:30] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 22:02:30] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 22:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 22:02:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:02:30] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 22:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 22:02:30] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 22:02:30] [INFO ] Added : 17 causal constraints over 4 iterations in 31 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 17 transition count 10
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 9 transition count 7
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 21 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 23 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 4 transition count 4
Applied a total of 24 rules in 3648 ms. Remains 4 /21 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 22:02:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 22:02:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 22:02:34] [INFO ] Invariant cache hit.
[2024-05-25 22:02:34] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-25 22:02:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:02:34] [INFO ] Invariant cache hit.
[2024-05-25 22:02:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3713 ms. Remains : 4/21 places, 4/18 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 820 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[p1]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 1064 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[p1]
Stuttering acceptance computed with spot in 47 ms :[p1]
[2024-05-25 22:02:36] [INFO ] Invariant cache hit.
[2024-05-25 22:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 22:02:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 22:02:36] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:02:36] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 49 ms :[p1]
Product exploration explored 100000 steps with 29577 reset in 82 ms.
Product exploration explored 100000 steps with 29905 reset in 98 ms.
Built C files in :
/tmp/ltsmin686096325883863382
[2024-05-25 22:02:36] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 22:02:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:02:36] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 22:02:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:02:36] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 22:02:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:02:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin686096325883863382
Running compilation step : cd /tmp/ltsmin686096325883863382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin686096325883863382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin686096325883863382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17488216503444433866.hoa' '--buchi-type=spotba'
LTSmin run took 924 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-08000-LTLCardinality-09 finished in 10701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:02:37] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 22:02:37] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9580 reset in 63 ms.
Product exploration explored 100000 steps with 9593 reset in 89 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=5334 ) properties (out of 1) seen :0
Finished Best-First random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 22:02:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 22:02:38] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 22:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 22:02:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:02:38] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 22:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 22:02:38] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 22:02:38] [INFO ] Added : 17 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 22:02:38] [INFO ] Invariant cache hit.
[2024-05-25 22:02:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 22:02:38] [INFO ] Invariant cache hit.
[2024-05-25 22:02:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-25 22:02:38] [INFO ] Invariant cache hit.
[2024-05-25 22:02:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 22:02:39] [INFO ] Invariant cache hit.
[2024-05-25 22:02:39] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 22:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 22:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:02:39] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 22:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:02:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 22:02:39] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 22:02:39] [INFO ] Added : 17 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9526 reset in 67 ms.
Product exploration explored 100000 steps with 9559 reset in 73 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 7 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 7 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 6
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 5 ms. Remains 6 /21 variables (removed 15) and now considering 5/18 (removed 13) transitions.
[2024-05-25 22:02:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2024-05-25 22:02:40] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 22:02:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 6/21 places, 5/18 transitions.
Built C files in :
/tmp/ltsmin1724115298552288036
[2024-05-25 22:02:40] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1724115298552288036
Running compilation step : cd /tmp/ltsmin1724115298552288036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin1724115298552288036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1724115298552288036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4661767312497886109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 22:02:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 22:02:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 22:02:55] [INFO ] Invariant cache hit.
[2024-05-25 22:02:55] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-25 22:02:55] [INFO ] Invariant cache hit.
[2024-05-25 22:02:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin8523828308015008357
[2024-05-25 22:02:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8523828308015008357
Running compilation step : cd /tmp/ltsmin8523828308015008357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin8523828308015008357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8523828308015008357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9357917260550377408.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 22:03:10] [INFO ] Flatten gal took : 4 ms
[2024-05-25 22:03:10] [INFO ] Flatten gal took : 4 ms
[2024-05-25 22:03:10] [INFO ] Time to serialize gal into /tmp/LTL11643888564023366722.gal : 2 ms
[2024-05-25 22:03:10] [INFO ] Time to serialize properties into /tmp/LTL6007799159280453477.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11643888564023366722.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2550529693492697655.hoa' '-atoms' '/tmp/LTL6007799159280453477.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6007799159280453477.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2550529693492697655.hoa
Detected timeout of ITS tools.
[2024-05-25 22:03:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 22:03:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 22:03:25] [INFO ] Time to serialize gal into /tmp/LTL6567748315025849480.gal : 7 ms
[2024-05-25 22:03:25] [INFO ] Time to serialize properties into /tmp/LTL6702833395019549681.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6567748315025849480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6702833395019549681.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p8>=1)")))))
Formula 0 simplified : XXG!"(p8>=1)"
Detected timeout of ITS tools.
[2024-05-25 22:03:40] [INFO ] Flatten gal took : 2 ms
[2024-05-25 22:03:40] [INFO ] Applying decomposition
[2024-05-25 22:03:40] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5519223538024647059.txt' '-o' '/tmp/graph5519223538024647059.bin' '-w' '/tmp/graph5519223538024647059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5519223538024647059.bin' '-l' '-1' '-v' '-w' '/tmp/graph5519223538024647059.weights' '-q' '0' '-e' '0.001'
[2024-05-25 22:03:40] [INFO ] Decomposing Gal with order
[2024-05-25 22:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 22:03:40] [INFO ] Flatten gal took : 3 ms
[2024-05-25 22:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 22:03:41] [INFO ] Time to serialize gal into /tmp/LTL12462514893668646987.gal : 1 ms
[2024-05-25 22:03:41] [INFO ] Time to serialize properties into /tmp/LTL12984393560102173901.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12462514893668646987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12984393560102173901.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i0.u1.p8>=1)")))))
Formula 0 simplified : XXG!"(i0.u1.p8>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16947542215727133822
[2024-05-25 22:03:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16947542215727133822
Running compilation step : cd /tmp/ltsmin16947542215727133822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin16947542215727133822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16947542215727133822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-10 finished in 93399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||(p1 U G(p2))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 5
Applied a total of 3 rules in 692 ms. Remains 8 /26 variables (removed 18) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-05-25 22:04:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 22:04:11] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 731 ms. Remains : 7/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s1 s5), p0:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 94 reset in 121 ms.
Product exploration explored 100000 steps with 14 reset in 146 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-11 finished in 1186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&G(p1))||(p2&&(p3 U G(p1)))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 11 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 7 transition count 6
Applied a total of 5 rules in 846 ms. Remains 7 /26 variables (removed 19) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 22:04:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 22:04:13] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 22:04:13] [INFO ] Invariant cache hit.
[2024-05-25 22:04:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 22:04:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:04:13] [INFO ] Invariant cache hit.
[2024-05-25 22:04:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 7/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p1 (NOT p2)) (AND p1 p2 (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s1), p2:(LEQ s1 s4), p1:(LEQ 1 s1), p3:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 48000 steps with 0 reset in 49 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-12 finished in 1175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(G(p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:04:13] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:04:13] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s16), p1:(GT s13 s5)], nbAcceptance=1, 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 286 reset in 159 ms.
Product exploration explored 100000 steps with 287 reset in 180 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=5334 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Finished Best-First random walk after 1651 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=330 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 22:04:14] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 22:04:14] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 22:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:04:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 22:04:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:04:14] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 22:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:04:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 22:04:14] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 22:04:15] [INFO ] Added : 17 causal constraints over 4 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 12
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 15 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 13 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 13 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 10 transition count 7
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 22 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 7 transition count 6
Applied a total of 24 rules in 647 ms. Remains 7 /21 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 22:04:15] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 22:04:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 22:04:15] [INFO ] Invariant cache hit.
[2024-05-25 22:04:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 22:04:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:04:15] [INFO ] Invariant cache hit.
[2024-05-25 22:04:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 ms. Remains : 7/21 places, 6/18 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 2) seen :0
Finished Best-First random walk after 238 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=238 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 309 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-25 22:04:16] [INFO ] Invariant cache hit.
[2024-05-25 22:04:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 22:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:04:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 22:04:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:04:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 22:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 22:04:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 22:04:16] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:04:16] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1496 reset in 121 ms.
Product exploration explored 100000 steps with 1500 reset in 142 ms.
Built C files in :
/tmp/ltsmin11810275543263577606
[2024-05-25 22:04:17] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 22:04:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:17] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 22:04:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:17] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 22:04:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11810275543263577606
Running compilation step : cd /tmp/ltsmin11810275543263577606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin11810275543263577606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11810275543263577606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17896784442788835659.hoa' '--buchi-type=spotba'
LTSmin run took 2840 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-08000-LTLCardinality-13 finished in 6682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(G(X(p0)) U (p0 U p1))||p2))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 22:04:20] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:04:20] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1), p1]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(LEQ s15 s0), p2:(GT 2 s15), p1:(LEQ s11 s14)], 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 33333 reset in 60 ms.
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (G p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-14 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 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 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 11 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 7 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 12 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 14 place count 5 transition count 4
Applied a total of 14 rules in 909 ms. Remains 5 /26 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 22:04:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 22:04:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 22:04:21] [INFO ] Invariant cache hit.
[2024-05-25 22:04:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-25 22:04:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:04:21] [INFO ] Invariant cache hit.
[2024-05-25 22:04:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 992 ms. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s4), p1:(LEQ s3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3170 reset in 69 ms.
Product exploration explored 100000 steps with 3138 reset in 85 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=5334 ) properties (out of 2) seen :0
Finished Best-First random walk after 60 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 22:04:22] [INFO ] Invariant cache hit.
[2024-05-25 22:04:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 22:04:23] [INFO ] Invariant cache hit.
[2024-05-25 22:04:23] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 22:04:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:04:23] [INFO ] Invariant cache hit.
[2024-05-25 22:04:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=5334 ) properties (out of 2) seen :0
Finished Best-First random walk after 30 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3108 reset in 117 ms.
Product exploration explored 100000 steps with 3219 reset in 140 ms.
Built C files in :
/tmp/ltsmin6699221967869088814
[2024-05-25 22:04:24] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 22:04:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:24] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 22:04:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:24] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 22:04:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6699221967869088814
Running compilation step : cd /tmp/ltsmin6699221967869088814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin6699221967869088814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6699221967869088814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9584022258719806255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 22:04:39] [INFO ] Invariant cache hit.
[2024-05-25 22:04:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 22:04:39] [INFO ] Invariant cache hit.
[2024-05-25 22:04:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-25 22:04:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:04:39] [INFO ] Invariant cache hit.
[2024-05-25 22:04:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 5/5 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin7416782399478051558
[2024-05-25 22:04:39] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 22:04:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:39] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 22:04:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:39] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 22:04:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:04:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7416782399478051558
Running compilation step : cd /tmp/ltsmin7416782399478051558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin7416782399478051558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7416782399478051558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9852333539765981157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 22:04:54] [INFO ] Flatten gal took : 5 ms
[2024-05-25 22:04:54] [INFO ] Flatten gal took : 2 ms
[2024-05-25 22:04:54] [INFO ] Time to serialize gal into /tmp/LTL9796901172207113910.gal : 1 ms
[2024-05-25 22:04:54] [INFO ] Time to serialize properties into /tmp/LTL15721092134340533845.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9796901172207113910.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13632691943266417108.hoa' '-atoms' '/tmp/LTL15721092134340533845.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(p20<3)"))&&(F("(p19<=p12)")))))
Formula 0 simplified : F(G!"(p20<3)" | G!"(p19<=p12)")
Detected timeout of ITS tools.
[2024-05-25 22:05:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 22:05:24] [INFO ] Applying decomposition
[2024-05-25 22:05:24] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9159706353545818495.txt' '-o' '/tmp/graph9159706353545818495.bin' '-w' '/tmp/graph9159706353545818495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9159706353545818495.bin' '-l' '-1' '-v' '-w' '/tmp/graph9159706353545818495.weights' '-q' '0' '-e' '0.001'
[2024-05-25 22:05:24] [INFO ] Decomposing Gal with order
[2024-05-25 22:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 22:05:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 22:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 22:05:24] [INFO ] Time to serialize gal into /tmp/LTL3573420817027523755.gal : 0 ms
[2024-05-25 22:05:24] [INFO ] Time to serialize properties into /tmp/LTL16390304258120787307.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3573420817027523755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16390304258120787307.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu1.p20<3)"))&&(F("(gu0.p19<=gu0.p12)")))))
Formula 0 simplified : F(G!"(gu1.p20<3)" | G!"(gu0.p19<=gu0.p12)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15074955245606053088
[2024-05-25 22:05:39] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15074955245606053088
Running compilation step : cd /tmp/ltsmin15074955245606053088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin15074955245606053088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15074955245606053088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-15 finished in 94394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(X(p1))))))'
Found a Shortening insensitive property : HouseConstruction-PT-08000-LTLCardinality-03
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 16 transition count 9
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 16 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 6 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 19 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 19 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 21 place count 4 transition count 4
Applied a total of 21 rules in 622 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 22:05:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 22:05:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 22:05:56] [INFO ] Invariant cache hit.
[2024-05-25 22:05:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-25 22:05:56] [INFO ] Invariant cache hit.
[2024-05-25 22:05:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 710 ms. Remains : 4/26 places, 4/18 transitions.
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s1), p1:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19397 reset in 90 ms.
Product exploration explored 100000 steps with 19334 reset in 105 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8001 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4000 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-25 22:05:57] [INFO ] Invariant cache hit.
[2024-05-25 22:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:05:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 22:05:57] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:05:57] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 22:05:57] [INFO ] Invariant cache hit.
[2024-05-25 22:05:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 22:05:57] [INFO ] Invariant cache hit.
[2024-05-25 22:05:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-25 22:05:57] [INFO ] Invariant cache hit.
[2024-05-25 22:05:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8001 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4000 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-25 22:05:58] [INFO ] Invariant cache hit.
[2024-05-25 22:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:05:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 22:05:58] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:05:58] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19405 reset in 87 ms.
Product exploration explored 100000 steps with 19441 reset in 111 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 22:05:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:05:59] [INFO ] Invariant cache hit.
[2024-05-25 22:05:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31 ms. Remains : 4/4 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin1907849186578198005
[2024-05-25 22:05:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1907849186578198005
Running compilation step : cd /tmp/ltsmin1907849186578198005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin1907849186578198005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1907849186578198005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3481269595905977720.hoa' '--buchi-type=spotba'
LTSmin run took 3205 ms.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-03 finished in 7382 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-03 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : HouseConstruction-PT-08000-LTLCardinality-10
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 7 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Reduce places removed 1 places and 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 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
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 5 transition count 3
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 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 2 transition count 2
Applied a total of 8 rules in 839 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 22:06:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 22:06:03] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 22:06:03] [INFO ] Invariant cache hit.
[2024-05-25 22:06:03] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 22:06:03] [INFO ] Invariant cache hit.
[2024-05-25 22:06:03] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 893 ms. Remains : 2/26 places, 2/18 transitions.
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28523 reset in 39 ms.
Product exploration explored 100000 steps with 28609 reset in 46 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 22:06:04] [INFO ] Invariant cache hit.
[2024-05-25 22:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:06:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 22:06:04] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 22:06:04] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-25 22:06:04] [INFO ] Invariant cache hit.
[2024-05-25 22:06:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 22:06:04] [INFO ] Invariant cache hit.
[2024-05-25 22:06:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 22:06:04] [INFO ] Invariant cache hit.
[2024-05-25 22:06:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 22:06:05] [INFO ] Invariant cache hit.
[2024-05-25 22:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 22:06:05] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 22:06:05] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 22:06:05] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28565 reset in 67 ms.
Product exploration explored 100000 steps with 28587 reset in 82 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-25 22:06:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:06:06] [INFO ] Invariant cache hit.
[2024-05-25 22:06:06] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26 ms. Remains : 2/2 places, 2/2 transitions.
Built C files in :
/tmp/ltsmin8197475821645196373
[2024-05-25 22:06:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8197475821645196373
Running compilation step : cd /tmp/ltsmin8197475821645196373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin8197475821645196373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8197475821645196373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12710561180350372897.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-10 finished in 3945 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-10 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
[2024-05-25 22:06:06] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11382884644949781769
[2024-05-25 22:06:06] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 22:06:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:06:06] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 22:06:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:06:06] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 22:06:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 22:06:06] [INFO ] Applying decomposition
[2024-05-25 22:06:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11382884644949781769
Running compilation step : cd /tmp/ltsmin11382884644949781769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 22:06:06] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph975545647505589787.txt' '-o' '/tmp/graph975545647505589787.bin' '-w' '/tmp/graph975545647505589787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph975545647505589787.bin' '-l' '-1' '-v' '-w' '/tmp/graph975545647505589787.weights' '-q' '0' '-e' '0.001'
[2024-05-25 22:06:06] [INFO ] Decomposing Gal with order
[2024-05-25 22:06:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 22:06:06] [INFO ] Flatten gal took : 5 ms
[2024-05-25 22:06:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 22:06:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality5478366433585790873.gal : 2 ms
[2024-05-25 22:06:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality11980421988783616162.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5478366433585790873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11980421988783616162.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((F("(gu5.p27>gu5.p19)"))&&(F("(gi1.gi2.gu9.p16<3)"))))
Formula 0 simplified : G!"(gu5.p27>gu5.p19)" | G!"(gi1.gi2.gu9.p16<3)"
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin11382884644949781769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11382884644949781769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp2==true))&&<>((LTLAPp3==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: (<>((LTLAPp2==true))&&<>((LTLAPp3==true)))
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: "(<>((LTLAPp2==true))&&<>((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 25, guards 18
pins2lts-mc-linux64( 0/ 8), 0.019: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.019: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.025: There are 27 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.025: State length is 27, there are 23 groups
pins2lts-mc-linux64( 0/ 8), 0.025: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.025: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.025: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.025: Visible groups: 0 / 23, labels: 2 / 27
pins2lts-mc-linux64( 0/ 8), 0.025: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.025: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.039: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 6/ 8), 0.046: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 6/ 8), 0.073: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.127: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 5/ 8), 0.226: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 1/ 8), 0.405: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 6/ 8), 0.723: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 1/ 8), 1.129: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 2/ 8), 1.707: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 3/ 8), 2.533: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 0/ 8), 5.162: [Blue] ~108569 levels ~983040 states ~1275648 transitions
pins2lts-mc-linux64( 2/ 8), 6.805: [Blue] ~143934 levels ~1966080 states ~2703400 transitions
pins2lts-mc-linux64( 0/ 8), 9.743: [Blue] ~143999 levels ~3932160 states ~6928104 transitions
pins2lts-mc-linux64( 1/ 8), 15.120: [Blue] ~143972 levels ~7864320 states ~15229296 transitions
pins2lts-mc-linux64( 1/ 8), 26.398: [Blue] ~143972 levels ~15728640 states ~31260616 transitions
pins2lts-mc-linux64( 1/ 8), 49.040: [Blue] ~143972 levels ~31457280 states ~63408904 transitions
pins2lts-mc-linux64( 1/ 8), 95.724: [Blue] ~143972 levels ~62914560 states ~128404080 transitions
pins2lts-mc-linux64( 2/ 8), 170.771: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 170.907:
pins2lts-mc-linux64( 0/ 8), 170.907: Explored 97548578 states 184147752 transitions, fanout: 1.888
pins2lts-mc-linux64( 0/ 8), 170.907: Total exploration time 170.840 sec (170.700 sec minimum, 170.772 sec on average)
pins2lts-mc-linux64( 0/ 8), 170.907: States per second: 570994, Transitions per second: 1077896
pins2lts-mc-linux64( 0/ 8), 170.907:
pins2lts-mc-linux64( 0/ 8), 170.907: State space has 83315382 states, 81482248 are accepting
pins2lts-mc-linux64( 0/ 8), 170.907: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 170.907: blue states: 97548578 (117.08%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 170.907: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 170.907: all-red states: 81482248 (97.80%), bogus 13763518 (16.52%)
pins2lts-mc-linux64( 0/ 8), 170.907:
pins2lts-mc-linux64( 0/ 8), 170.907: Total memory used for local state coloring: 17.6MB
pins2lts-mc-linux64( 0/ 8), 170.907:
pins2lts-mc-linux64( 0/ 8), 170.907: Queue width: 8B, total height: 1151691, memory: 8.79MB
pins2lts-mc-linux64( 0/ 8), 170.907: Tree memory: 891.6MB, 11.2 B/state, compr.: 10.2%
pins2lts-mc-linux64( 0/ 8), 170.907: Tree fill ratio (roots/leafs): 62.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 170.907: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 170.907: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 170.907: Est. total memory use: 900.4MB (~1032.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11382884644949781769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp2==true))&&<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11382884644949781769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp2==true))&&<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 22:28:30] [INFO ] Flatten gal took : 119 ms
[2024-05-25 22:28:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality11615304602577093947.gal : 23 ms
[2024-05-25 22:28:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality3954740563684078764.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11615304602577093947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3954740563684078764.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((F("(p27>p19)"))&&(F("(p16<3)"))))
Formula 0 simplified : G!"(p27>p19)" | G!"(p16<3)"
Detected timeout of ITS tools.
[2024-05-25 22:50:53] [INFO ] Flatten gal took : 3 ms
[2024-05-25 22:50:53] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-25 22:50:53] [INFO ] Transformed 26 places.
[2024-05-25 22:50:53] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 22:50:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality15506308263534639021.gal : 1 ms
[2024-05-25 22:50:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality18120611221375752124.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15506308263534639021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18120611221375752124.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(p27>p19)"))&&(F("(p16<3)"))))
Formula 0 simplified : G!"(p27>p19)" | G!"(p16<3)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10412832 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15891732 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is HouseConstruction-PT-08000, 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 r219-smll-171649598000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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