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-171649597900117.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-00100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597900117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.3K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 18:11 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-00100-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716659412106

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-00100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 17:50:15] [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 17:50:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:50:15] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-25 17:50:15] [INFO ] Transformed 26 places.
[2024-05-25 17:50:15] [INFO ] Transformed 18 transitions.
[2024-05-25 17:50:15] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 13 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 17:50:15] [INFO ] Computed 8 invariants in 5 ms
[2024-05-25 17:50:16] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 17:50:16] [INFO ] Invariant cache hit.
[2024-05-25 17:50:16] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-25 17:50:16] [INFO ] Invariant cache hit.
[2024-05-25 17:50:16] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 25 out of 26 places after structural reductions.
[2024-05-25 17:50:16] [INFO ] Flatten gal took : 32 ms
[2024-05-25 17:50:16] [INFO ] Flatten gal took : 10 ms
[2024-05-25 17:50:16] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10004 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 28) seen :27
Finished Best-First random walk after 656 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 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' '!((G((p0||G(p1)))||G(p2)))'
Support contains 4 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 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 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 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 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 11
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 14 transition count 10
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 13 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 12 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 11 transition count 8
Applied a total of 8 rules in 31 ms. Remains 11 /26 variables (removed 15) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-25 17:50:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:50:17] [INFO ] Implicit Places using invariants in 44 ms returned [3, 5, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/26 places, 8/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 8/26 places, 8/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 503 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ 1 s3), p2:(GT 3 s7), p0:(LEQ s2 s5)], 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, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-00 finished in 695 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(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 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 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 13 transition count 7
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 22 place count 12 transition count 7
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 26 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 7 transition count 4
Applied a total of 29 rules in 12 ms. Remains 7 /26 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-05-25 17:50:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:50:18] [INFO ] Implicit Places using invariants in 33 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46 ms. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s2 s4), p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1330 reset in 317 ms.
Product exploration explored 100000 steps with 1238 reset in 194 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 (NOT p1) p0), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT 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 3 factoid took 665 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT 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 (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 782 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
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.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 17:50:20] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 17:50:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 17:50:20] [INFO ] Invariant cache hit.
[2024-05-25 17:50:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 17:50:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:50:20] [INFO ] Invariant cache hit.
[2024-05-25 17:50:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 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 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 688 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 771 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1211 reset in 226 ms.
Product exploration explored 100000 steps with 1208 reset in 224 ms.
Built C files in :
/tmp/ltsmin4798906417876072768
[2024-05-25 17:50:23] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 17:50:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:50:23] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 17:50:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:50:23] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 17:50:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:50:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4798906417876072768
Running compilation step : cd /tmp/ltsmin4798906417876072768;'/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 338 ms.
Running link step : cd /tmp/ltsmin4798906417876072768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4798906417876072768;'/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/stateBased15215810377535055528.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 17:50:38] [INFO ] Invariant cache hit.
[2024-05-25 17:50:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 17:50:38] [INFO ] Invariant cache hit.
[2024-05-25 17:50:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 17:50:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:50:38] [INFO ] Invariant cache hit.
[2024-05-25 17:50:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 5/5 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin12970481510590612001
[2024-05-25 17:50:38] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 17:50:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:50:38] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 17:50:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:50:38] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 17:50:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:50:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12970481510590612001
Running compilation step : cd /tmp/ltsmin12970481510590612001;'/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 85 ms.
Running link step : cd /tmp/ltsmin12970481510590612001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12970481510590612001;'/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/stateBased401402420701873457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:50:53] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:50:53] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:50:53] [INFO ] Time to serialize gal into /tmp/LTL14592959763237908148.gal : 1 ms
[2024-05-25 17:50:53] [INFO ] Time to serialize properties into /tmp/LTL12521169669144232552.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/LTL14592959763237908148.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1109347432942809779.hoa' '-atoms' '/tmp/LTL12521169669144232552.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/LTL12521169669144232552.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1109347432942809779.hoa
Detected timeout of ITS tools.
[2024-05-25 17:51:09] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:51:09] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:51:09] [INFO ] Time to serialize gal into /tmp/LTL16540385244124880432.gal : 0 ms
[2024-05-25 17:51:09] [INFO ] Time to serialize properties into /tmp/LTL8093282502809887832.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/LTL16540385244124880432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8093282502809887832.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p21<1)")||(X(F(("(p21<1)")&&(F("(p26>p23)")))))))))
Formula 0 simplified : G(F!"(p21<1)" & F(G!"(p26>p23)" | G!"(p21<1)"))
Detected timeout of ITS tools.
[2024-05-25 17:51:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:51:24] [INFO ] Applying decomposition
[2024-05-25 17:51:24] [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/graph553167025832274442.txt' '-o' '/tmp/graph553167025832274442.bin' '-w' '/tmp/graph553167025832274442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph553167025832274442.bin' '-l' '-1' '-v' '-w' '/tmp/graph553167025832274442.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:51:24] [INFO ] Decomposing Gal with order
[2024-05-25 17:51:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:51:24] [INFO ] Flatten gal took : 36 ms
[2024-05-25 17:51:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 17:51:24] [INFO ] Time to serialize gal into /tmp/LTL201487699865655341.gal : 1 ms
[2024-05-25 17:51:24] [INFO ] Time to serialize properties into /tmp/LTL9960167441147815152.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/LTL201487699865655341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9960167441147815152.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu0.p21<1)")||(X(F(("(gu0.p21<1)")&&(F("(gu1.p26>gu1.p23)")))))))))
Formula 0 simplified : G(F!"(gu0.p21<1)" & F(G!"(gu1.p26>gu1.p23)" | G!"(gu0.p21<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17519998733293923719
[2024-05-25 17:51:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17519998733293923719
Running compilation step : cd /tmp/ltsmin17519998733293923719;'/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 77 ms.
Running link step : cd /tmp/ltsmin17519998733293923719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17519998733293923719;'/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(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-01 finished in 96370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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 8 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 4 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 3 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 17:51:54] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 17:51:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 17:51:54] [INFO ] Invariant cache hit.
[2024-05-25 17:51:54] [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 17:51:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:51:54] [INFO ] Invariant cache hit.
[2024-05-25 17:51:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 249 reset in 211 ms.
Product exploration explored 100000 steps with 249 reset in 297 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 : [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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLCardinality-02 finished in 687 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(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.
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 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 15 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 24 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 9 transition count 6
Applied a total of 25 rules in 9 ms. Remains 9 /26 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 17:51:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:51:55] [INFO ] Implicit Places using invariants in 31 ms returned [0, 3, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43 ms. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s5 s2), p1:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 600 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-03 finished in 170 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)))&&F(p1)))'
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 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 17:51:55] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 17:51:55] [INFO ] Implicit Places using invariants in 37 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 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 41 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s4 s7), p0:(GT s2 s5)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25042 reset in 121 ms.
Product exploration explored 100000 steps with 25142 reset in 149 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 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 180 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 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 17:51:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:51:56] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 17:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:51:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 17:51:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:51:56] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 17:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:51:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 17:51:56] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 17:51:56] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 17:51:56] [INFO ] Invariant cache hit.
[2024-05-25 17:51:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 17:51:56] [INFO ] Invariant cache hit.
[2024-05-25 17:51:56] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-25 17:51:56] [INFO ] Invariant cache hit.
[2024-05-25 17:51:56] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 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), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 173 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)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
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 204 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)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 17:51:57] [INFO ] Invariant cache hit.
[2024-05-25 17:51:57] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 17:51:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:51:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 17:51:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:51:57] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 17:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:51:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-25 17:51:57] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-25 17:51:57] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24967 reset in 96 ms.
Product exploration explored 100000 steps with 25030 reset in 105 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
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 5 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 13 output transitions
Drop transitions removed 13 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 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 5 /21 variables (removed 16) and now considering 5/18 (removed 13) transitions.
[2024-05-25 17:51:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2024-05-25 17:51:58] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 17:51:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/21 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 5/21 places, 5/18 transitions.
Built C files in :
/tmp/ltsmin10392629023867029499
[2024-05-25 17:51:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10392629023867029499
Running compilation step : cd /tmp/ltsmin10392629023867029499;'/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 134 ms.
Running link step : cd /tmp/ltsmin10392629023867029499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10392629023867029499;'/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/stateBased17844818238741816462.hoa' '--buchi-type=spotba'
LTSmin run took 207 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00100-LTLCardinality-04 finished in 3847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 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 17:51:59] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 17:51:59] [INFO ] Implicit Places using invariants in 61 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 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 66 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s8)], 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-00100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-06 finished in 200 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)))&&X(F(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 17:51:59] [INFO ] Invariant cache hit.
[2024-05-25 17:51:59] [INFO ] Implicit Places using invariants in 61 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 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 66 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s19 s8), p1:(GT 3 s19)], 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 667 reset in 222 ms.
Product exploration explored 100000 steps with 709 reset in 273 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) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (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 310 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 3032 steps, including 1 resets, run visited all 4 properties in 6 ms. (steps per millisecond=505 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 674 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 17:52:02] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:52:02] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 17:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:52:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 17:52:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:52:02] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 17:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:52:02] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 17:52:02] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 17:52:02] [INFO ] Added : 17 causal constraints over 4 iterations in 65 ms. Result :sat
Could not prove EG (NOT p0)
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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 11
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 13 transition count 10
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 13 transition count 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 25 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 26 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 26 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 28 place count 5 transition count 4
Applied a total of 28 rules in 17 ms. Remains 5 /21 variables (removed 16) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 17:52:02] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 17:52:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 17:52:02] [INFO ] Invariant cache hit.
[2024-05-25 17:52:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-25 17:52:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:52:02] [INFO ] Invariant cache hit.
[2024-05-25 17:52:02] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 5/21 places, 4/18 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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 403 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 303 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 834 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-25 17:52:04] [INFO ] Invariant cache hit.
[2024-05-25 17:52:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 17:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:52:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:52:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 17:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:52:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 17:52:04] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:52:04] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2857 reset in 116 ms.
Product exploration explored 100000 steps with 2920 reset in 261 ms.
Built C files in :
/tmp/ltsmin3739165181499204828
[2024-05-25 17:52:05] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 17:52:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:52:05] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 17:52:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:52:05] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 17:52:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:52:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3739165181499204828
Running compilation step : cd /tmp/ltsmin3739165181499204828;'/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 145 ms.
Running link step : cd /tmp/ltsmin3739165181499204828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3739165181499204828;'/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/stateBased8305745715986275435.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 17:52:20] [INFO ] Invariant cache hit.
[2024-05-25 17:52:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 17:52:20] [INFO ] Invariant cache hit.
[2024-05-25 17:52:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 17:52:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:52:20] [INFO ] Invariant cache hit.
[2024-05-25 17:52:20] [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 70 ms. Remains : 5/5 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin1219581151577403969
[2024-05-25 17:52:20] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 17:52:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:52:20] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 17:52:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:52:20] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 17:52:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:52:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1219581151577403969
Running compilation step : cd /tmp/ltsmin1219581151577403969;'/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/ltsmin1219581151577403969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1219581151577403969;'/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/stateBased9661730787111139369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:52:35] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:52:35] [INFO ] Flatten gal took : 0 ms
[2024-05-25 17:52:35] [INFO ] Time to serialize gal into /tmp/LTL11238636765557291004.gal : 1 ms
[2024-05-25 17:52:35] [INFO ] Time to serialize properties into /tmp/LTL16909895399978124640.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/LTL11238636765557291004.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2146940295387505085.hoa' '-atoms' '/tmp/LTL16909895399978124640.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/LTL16909895399978124640.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2146940295387505085.hoa
Detected timeout of ITS tools.
[2024-05-25 17:52:50] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:52:50] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:52:50] [INFO ] Time to serialize gal into /tmp/LTL1231781431230334707.gal : 1 ms
[2024-05-25 17:52:50] [INFO ] Time to serialize properties into /tmp/LTL959190500826642292.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/LTL1231781431230334707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL959190500826642292.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...274
Read 1 LTL properties
Checking formula 0 : !(((F(("(p25>p8)")&&(F("(p25<3)"))))&&(X(F("(p25<3)")))))
Formula 0 simplified : G(!"(p25>p8)" | G!"(p25<3)") | XG!"(p25<3)"
Detected timeout of ITS tools.
[2024-05-25 17:53:05] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:53:05] [INFO ] Applying decomposition
[2024-05-25 17:53:05] [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/graph6769946048502123780.txt' '-o' '/tmp/graph6769946048502123780.bin' '-w' '/tmp/graph6769946048502123780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6769946048502123780.bin' '-l' '-1' '-v' '-w' '/tmp/graph6769946048502123780.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:53:05] [INFO ] Decomposing Gal with order
[2024-05-25 17:53:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:53:05] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:53:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 17:53:05] [INFO ] Time to serialize gal into /tmp/LTL12981358358371156535.gal : 7 ms
[2024-05-25 17:53:05] [INFO ] Time to serialize properties into /tmp/LTL13938558338047672906.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/LTL12981358358371156535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13938558338047672906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(("(gu1.p25>gu1.p8)")&&(F("(gu1.p25<3)"))))&&(X(F("(gu1.p25<3)")))))
Formula 0 simplified : G(!"(gu1.p25>gu1.p8)" | G!"(gu1.p25<3)") | XG!"(gu1.p25<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14871473717117415342
[2024-05-25 17:53:20] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14871473717117415342
Running compilation step : cd /tmp/ltsmin14871473717117415342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin14871473717117415342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14871473717117415342;'/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))))&&X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-07 finished in 96784 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((G(F(p0)) U (p1&&F(p2))))))'
Support contains 4 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 17 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 16 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 22 place count 11 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 10 transition count 7
Applied a total of 23 rules in 10 ms. Remains 10 /26 variables (removed 16) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-25 17:53:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:53:36] [INFO ] Implicit Places using invariants in 26 ms returned [3, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/26 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37 ms. Remains : 8/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s6 s7), p0:(LEQ 1 s2), p2:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 932 steps with 16 reset in 2 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-09 finished in 302 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(F(p0)))||(p1&&X(p1)))))'
Support contains 4 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 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 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 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 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 11
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 15 transition count 8
Deduced a syphon composed of 3 places in 1 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 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 10 transition count 7
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 13 place count 9 transition count 7
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 17 place count 6 transition count 6
Applied a total of 17 rules in 9 ms. Remains 6 /26 variables (removed 20) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 17:53:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 17:53:36] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 17:53:36] [INFO ] Invariant cache hit.
[2024-05-25 17:53:36] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-25 17:53:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:53:36] [INFO ] Invariant cache hit.
[2024-05-25 17:53:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 6/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p0), (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s5 s2), p1:(LEQ s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3785 steps with 96 reset in 11 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-10 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Reduce places removed 1 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 25 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 22 transition count 14
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 22 transition count 8
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 21 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 13 transition count 7
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 23 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 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 27 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 11 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 17:53:36] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 17:53:36] [INFO ] Implicit Places using invariants in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 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 1 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 41 ms. Remains : 7/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s2 s6) (LEQ s3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 199 reset in 210 ms.
Product exploration explored 100000 steps with 199 reset in 174 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-25 17:53:37] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 17:53:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 17:53:37] [INFO ] Invariant cache hit.
[2024-05-25 17:53:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 17:53:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:53:37] [INFO ] Invariant cache hit.
[2024-05-25 17:53:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 7/7 places, 5/5 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 133 ms.
Product exploration explored 100000 steps with 199 reset in 148 ms.
Built C files in :
/tmp/ltsmin1437996734460550947
[2024-05-25 17:53:38] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-25 17:53:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:53:38] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-25 17:53:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:53:38] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-25 17:53:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:53:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1437996734460550947
Running compilation step : cd /tmp/ltsmin1437996734460550947;'/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 123 ms.
Running link step : cd /tmp/ltsmin1437996734460550947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1437996734460550947;'/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/stateBased11836827154114105089.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-25 17:53:54] [INFO ] Invariant cache hit.
[2024-05-25 17:53:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 17:53:54] [INFO ] Invariant cache hit.
[2024-05-25 17:53:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 17:53:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:53:54] [INFO ] Invariant cache hit.
[2024-05-25 17:53:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 7/7 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin9690859496776000138
[2024-05-25 17:53:54] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-25 17:53:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:53:54] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-25 17:53:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:53:54] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-25 17:53:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:53:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9690859496776000138
Running compilation step : cd /tmp/ltsmin9690859496776000138;'/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 87 ms.
Running link step : cd /tmp/ltsmin9690859496776000138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9690859496776000138;'/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/stateBased14144389513877025298.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:54:09] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:54:09] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:54:09] [INFO ] Time to serialize gal into /tmp/LTL14345336420289067426.gal : 1 ms
[2024-05-25 17:54:09] [INFO ] Time to serialize properties into /tmp/LTL11575204607709139907.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/LTL14345336420289067426.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2482801688676742794.hoa' '-atoms' '/tmp/LTL11575204607709139907.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/LTL11575204607709139907.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2482801688676742794.hoa
Detected timeout of ITS tools.
[2024-05-25 17:54:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:54:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:54:24] [INFO ] Time to serialize gal into /tmp/LTL18029416437206051030.gal : 4 ms
[2024-05-25 17:54:24] [INFO ] Time to serialize properties into /tmp/LTL13490285876682791633.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/LTL18029416437206051030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13490285876682791633.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p19<=p25)&&(p20<=p27))"))))
Formula 0 simplified : GF!"((p19<=p25)&&(p20<=p27))"
Detected timeout of ITS tools.
[2024-05-25 17:54:39] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:54:39] [INFO ] Applying decomposition
[2024-05-25 17:54:39] [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/graph7342813607040303521.txt' '-o' '/tmp/graph7342813607040303521.bin' '-w' '/tmp/graph7342813607040303521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7342813607040303521.bin' '-l' '-1' '-v' '-w' '/tmp/graph7342813607040303521.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:54:39] [INFO ] Decomposing Gal with order
[2024-05-25 17:54:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:54:39] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:54:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 17:54:39] [INFO ] Time to serialize gal into /tmp/LTL3796375028673892076.gal : 1 ms
[2024-05-25 17:54:39] [INFO ] Time to serialize properties into /tmp/LTL14826590338258013713.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/LTL3796375028673892076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14826590338258013713.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((gu0.p19<=gu0.p25)&&(gu1.p20<=gu1.p27))"))))
Formula 0 simplified : GF!"((gu0.p19<=gu0.p25)&&(gu1.p20<=gu1.p27))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17052797705221684216
[2024-05-25 17:54:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17052797705221684216
Running compilation step : cd /tmp/ltsmin17052797705221684216;'/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 78 ms.
Running link step : cd /tmp/ltsmin17052797705221684216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17052797705221684216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-11 finished in 92899 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(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 15 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 1 places
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 14 transition count 8
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 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 10 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 9 place count 10 transition count 6
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 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 8 transition count 5
Applied a total of 13 rules in 3 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 17:55:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 17:55:09] [INFO ] Implicit Places using invariants in 27 ms returned [2, 3, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 5/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ 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={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s2 s4), p1:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25010 reset in 44 ms.
Product exploration explored 100000 steps with 24998 reset in 61 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 207 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 8 factoid took 351 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 5 cols
[2024-05-25 17:55:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 17:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:55:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 17:55:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:55:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 17:55:10] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:55:10] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 5 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 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-25 17:55:10] [INFO ] Invariant cache hit.
[2024-05-25 17:55:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 17:55:10] [INFO ] Invariant cache hit.
[2024-05-25 17:55:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 17:55:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:55:10] [INFO ] Invariant cache hit.
[2024-05-25 17:55:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 5/5 places, 5/5 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 177 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 48 ms :[(NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 216 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-05-25 17:55:11] [INFO ] Invariant cache hit.
[2024-05-25 17:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:55:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 17:55:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:55:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 17:55:11] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:55:11] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25015 reset in 71 ms.
Product exploration explored 100000 steps with 24993 reset in 87 ms.
Built C files in :
/tmp/ltsmin1879989999762229017
[2024-05-25 17:55:11] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-25 17:55:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:55:11] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-25 17:55:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:55:11] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-25 17:55:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:55:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1879989999762229017
Running compilation step : cd /tmp/ltsmin1879989999762229017;'/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 120 ms.
Running link step : cd /tmp/ltsmin1879989999762229017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1879989999762229017;'/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/stateBased5189898527260262248.hoa' '--buchi-type=spotba'
LTSmin run took 69 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00100-LTLCardinality-12 finished in 2359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 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 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 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
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 23 place count 11 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 11 transition count 5
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 28 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 8 transition count 4
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 30 place count 7 transition count 4
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 34 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 35 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 35 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 37 place count 2 transition count 2
Applied a total of 37 rules in 12 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 17:55:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 17:55:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 17:55:11] [INFO ] Invariant cache hit.
[2024-05-25 17:55:11] [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 17:55:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:55:11] [INFO ] Invariant cache hit.
[2024-05-25 17:55:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 497 reset in 73 ms.
Product exploration explored 100000 steps with 497 reset in 89 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 : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00100-LTLCardinality-13 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(p1)&&X(p2)&&(p3||F(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 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 17:55:12] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 17:55:12] [INFO ] Implicit Places using invariants in 48 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 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 54 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s11), p1:(LEQ s3 s6), p3:(LEQ 1 s15), p2:(LEQ s15 s10)], 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 3605 reset in 245 ms.
Product exploration explored 100000 steps with 3551 reset in 268 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) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 301 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10004 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 17:55:13] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 17:55:13] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:55:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 17:55:13] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:55:13] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-25 17:55:13] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p3))]
Knowledge based reduction with 17 factoid took 1227 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-05-25 17:55:15] [INFO ] Invariant cache hit.
[2024-05-25 17:55:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 17:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:55:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 17:55:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:55:15] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 5 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 17:55:15] [INFO ] Invariant cache hit.
[2024-05-25 17:55:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 17:55:15] [INFO ] Invariant cache hit.
[2024-05-25 17:55:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-25 17:55:15] [INFO ] Invariant cache hit.
[2024-05-25 17:55:15] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 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) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 508 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10004 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 17:55:16] [INFO ] Invariant cache hit.
[2024-05-25 17:55:16] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:55:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 17:55:16] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:55:16] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 17:55:16] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p3))]
Knowledge based reduction with 17 factoid took 1149 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-05-25 17:55:17] [INFO ] Invariant cache hit.
[2024-05-25 17:55:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 17:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:55:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 17:55:17] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 17:55:18] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3591 reset in 248 ms.
Product exploration explored 100000 steps with 3589 reset in 264 ms.
Built C files in :
/tmp/ltsmin16608463417507589863
[2024-05-25 17:55:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16608463417507589863
Running compilation step : cd /tmp/ltsmin16608463417507589863;'/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/ltsmin16608463417507589863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16608463417507589863;'/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/stateBased11965686025227479831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 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 17:55:33] [INFO ] Invariant cache hit.
[2024-05-25 17:55:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 17:55:34] [INFO ] Invariant cache hit.
[2024-05-25 17:55:34] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 17:55:34] [INFO ] Invariant cache hit.
[2024-05-25 17:55:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin14270055761334632629
[2024-05-25 17:55:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14270055761334632629
Running compilation step : cd /tmp/ltsmin14270055761334632629;'/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/ltsmin14270055761334632629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin14270055761334632629;'/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/stateBased15460052391498655979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:55:49] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:55:49] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:55:49] [INFO ] Time to serialize gal into /tmp/LTL3019380444033332171.gal : 1 ms
[2024-05-25 17:55:49] [INFO ] Time to serialize properties into /tmp/LTL5367599545841170370.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/LTL3019380444033332171.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14461889275974731388.hoa' '-atoms' '/tmp/LTL5367599545841170370.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/LTL5367599545841170370.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14461889275974731388.hoa
Detected timeout of ITS tools.
[2024-05-25 17:56:04] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:56:04] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:56:04] [INFO ] Time to serialize gal into /tmp/LTL141905205223323523.gal : 0 ms
[2024-05-25 17:56:04] [INFO ] Time to serialize properties into /tmp/LTL8365639967895289939.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/LTL141905205223323523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8365639967895289939.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...274
Read 1 LTL properties
Checking formula 0 : !((F(("(p13>=2)")||(((G("(p6<=p15)"))&&(X("(p18<=p10)")))&&(("(p18>=1)")||(F("(p13>=2)")))))))
Formula 0 simplified : G(!"(p13>=2)" & (F!"(p6<=p15)" | X!"(p18<=p10)" | (!"(p18>=1)" & G!"(p13>=2)")))
Detected timeout of ITS tools.
[2024-05-25 17:56:19] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:56:19] [INFO ] Applying decomposition
[2024-05-25 17:56:19] [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/graph8220213274561094960.txt' '-o' '/tmp/graph8220213274561094960.bin' '-w' '/tmp/graph8220213274561094960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8220213274561094960.bin' '-l' '-1' '-v' '-w' '/tmp/graph8220213274561094960.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:56:19] [INFO ] Decomposing Gal with order
[2024-05-25 17:56:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:56:19] [INFO ] Flatten gal took : 3 ms
[2024-05-25 17:56:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 17:56:19] [INFO ] Time to serialize gal into /tmp/LTL13181012685721895806.gal : 1 ms
[2024-05-25 17:56:19] [INFO ] Time to serialize properties into /tmp/LTL15828855616371756324.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/LTL13181012685721895806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15828855616371756324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(gi3.gi0.gu3.p13>=2)")||(((G("(gu2.p6<=gu2.p15)"))&&(X("(gu4.p18<=gu4.p10)")))&&(("(gu4.p18>=1)")||(F("(gi3.gi0.gu3.p13>=2)")))...159
Formula 0 simplified : G(!"(gi3.gi0.gu3.p13>=2)" & (F!"(gu2.p6<=gu2.p15)" | X!"(gu4.p18<=gu4.p10)" | (!"(gu4.p18>=1)" & G!"(gi3.gi0.gu3.p13>=2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9505047829841265991
[2024-05-25 17:56:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9505047829841265991
Running compilation step : cd /tmp/ltsmin9505047829841265991;'/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/ltsmin9505047829841265991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9505047829841265991;'/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))&&X((LTLAPp2==true))&&((LTLAPp3==true)||<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-14 finished in 97265 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(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 17:56:49] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 17:56:49] [INFO ] Implicit Places using invariants in 38 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 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 43 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-15 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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT 3 s11), p0:(LEQ s18 s14)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 336 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00100-LTLCardinality-15 finished in 263 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(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' '!((F((p0&&F(p1)))&&X(F(p1))))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLCardinality-07
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (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.
Ensure Unique test removed 1 places
Reduce places removed 2 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 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 14 transition count 8
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 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 12 transition count 6
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 24 place count 11 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 10 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 9 transition count 4
Applied a total of 27 rules in 11 ms. Remains 9 /26 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 9 cols
[2024-05-25 17:56:50] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 17:56:50] [INFO ] Implicit Places using invariants in 35 ms returned [0, 3, 5, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 49 ms. Remains : 5/26 places, 4/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s4 s2), p1:(GT 3 s4)], 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 2879 reset in 97 ms.
Product exploration explored 100000 steps with 2936 reset in 112 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (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 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 303 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=151 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 627 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 17:56:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 17:56:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 17:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:56:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 17:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:56:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 17:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:56:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 17:56:52] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:56:52] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 17:56:52] [INFO ] Invariant cache hit.
[2024-05-25 17:56:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 17:56:52] [INFO ] Invariant cache hit.
[2024-05-25 17:56:52] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-25 17:56:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:56:52] [INFO ] Invariant cache hit.
[2024-05-25 17:56:52] [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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 258 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 608 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=304 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 766 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-25 17:56:54] [INFO ] Invariant cache hit.
[2024-05-25 17:56:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 17:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:56:54] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 17:56:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:56:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 17:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:56:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 17:56:54] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 17:56:54] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2945 reset in 63 ms.
Product exploration explored 100000 steps with 2961 reset in 75 ms.
Built C files in :
/tmp/ltsmin7466216639576906955
[2024-05-25 17:56:54] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 17:56:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:56:54] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 17:56:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:56:54] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 17:56:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:56:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7466216639576906955
Running compilation step : cd /tmp/ltsmin7466216639576906955;'/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 131 ms.
Running link step : cd /tmp/ltsmin7466216639576906955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7466216639576906955;'/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/stateBased238814939281551113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 17:57:09] [INFO ] Invariant cache hit.
[2024-05-25 17:57:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 17:57:09] [INFO ] Invariant cache hit.
[2024-05-25 17:57:09] [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 17:57:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:57:09] [INFO ] Invariant cache hit.
[2024-05-25 17:57:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 5/5 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin5389134893121977611
[2024-05-25 17:57:09] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 17:57:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:57:09] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 17:57:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:57:09] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 17:57:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:57:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5389134893121977611
Running compilation step : cd /tmp/ltsmin5389134893121977611;'/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 76 ms.
Running link step : cd /tmp/ltsmin5389134893121977611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5389134893121977611;'/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/stateBased2818825586516849677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:57:24] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:57:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:57:24] [INFO ] Time to serialize gal into /tmp/LTL6341151716327548873.gal : 1 ms
[2024-05-25 17:57:24] [INFO ] Time to serialize properties into /tmp/LTL9316123374325906904.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/LTL6341151716327548873.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15778485234818497222.hoa' '-atoms' '/tmp/LTL9316123374325906904.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/LTL9316123374325906904.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15778485234818497222.hoa
Detected timeout of ITS tools.
[2024-05-25 17:57:39] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:57:39] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:57:39] [INFO ] Time to serialize gal into /tmp/LTL10327892737786701653.gal : 1 ms
[2024-05-25 17:57:39] [INFO ] Time to serialize properties into /tmp/LTL1275386967384868012.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/LTL10327892737786701653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1275386967384868012.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(("(p25>p8)")&&(F("(p25<3)"))))&&(X(F("(p25<3)")))))
Formula 0 simplified : G(!"(p25>p8)" | G!"(p25<3)") | XG!"(p25<3)"
Detected timeout of ITS tools.
[2024-05-25 17:57:55] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:57:55] [INFO ] Applying decomposition
[2024-05-25 17:57:55] [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/graph11294394324884172260.txt' '-o' '/tmp/graph11294394324884172260.bin' '-w' '/tmp/graph11294394324884172260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11294394324884172260.bin' '-l' '-1' '-v' '-w' '/tmp/graph11294394324884172260.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:57:55] [INFO ] Decomposing Gal with order
[2024-05-25 17:57:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:57:55] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:57:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 17:57:55] [INFO ] Time to serialize gal into /tmp/LTL11704294210081179284.gal : 1 ms
[2024-05-25 17:57:55] [INFO ] Time to serialize properties into /tmp/LTL1862831522852710717.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/LTL11704294210081179284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1862831522852710717.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.p25>gu1.p8)")&&(F("(gu1.p25<3)"))))&&(X(F("(gu1.p25<3)")))))
Formula 0 simplified : G(!"(gu1.p25>gu1.p8)" | G!"(gu1.p25<3)") | XG!"(gu1.p25<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14569099200990719437
[2024-05-25 17:58:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14569099200990719437
Running compilation step : cd /tmp/ltsmin14569099200990719437;'/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 79 ms.
Running link step : cd /tmp/ltsmin14569099200990719437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14569099200990719437;'/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))))&&X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-07 finished in 95319 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(p1)&&X(p2)&&(p3||F(p0))))))'
Found a Shortening insensitive property : HouseConstruction-PT-00100-LTLCardinality-14
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 5 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 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 15 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 13 transition count 9
Applied a total of 7 rules in 21 ms. Remains 13 /26 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-25 17:58:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 17:58:25] [INFO ] Implicit Places using invariants in 36 ms returned [1, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/26 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 60 ms. Remains : 11/26 places, 9/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s8), p1:(LEQ s1 s4), p3:(LEQ 1 s10), p2:(LEQ s10 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7902 reset in 167 ms.
Product exploration explored 100000 steps with 7949 reset in 152 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 15 factoid took 788 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10009 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 11 cols
[2024-05-25 17:58:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 17:58:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:58:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 17:58:26] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:58:27] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 17:58:27] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p3))]
Knowledge based reduction with 15 factoid took 1248 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2475 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-05-25 17:58:30] [INFO ] Invariant cache hit.
[2024-05-25 17:58:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 17:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:58:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:58:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:58:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 17:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:58:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:58:31] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:58:31] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-25 17:58:31] [INFO ] Invariant cache hit.
[2024-05-25 17:58:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 17:58:31] [INFO ] Invariant cache hit.
[2024-05-25 17:58:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 17:58:31] [INFO ] Invariant cache hit.
[2024-05-25 17:58:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 11/11 places, 9/9 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 15 factoid took 829 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10009 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 17:58:32] [INFO ] Invariant cache hit.
[2024-05-25 17:58:32] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:58:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 17:58:32] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:58:32] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 17:58:32] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 p3))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p3))]
Knowledge based reduction with 15 factoid took 1243 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-05-25 17:58:33] [INFO ] Invariant cache hit.
[2024-05-25 17:58:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 17:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:58:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 17:58:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:58:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 17:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:58:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:58:33] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:58:33] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7710 reset in 224 ms.
Product exploration explored 100000 steps with 7844 reset in 250 ms.
Built C files in :
/tmp/ltsmin12876546608960470855
[2024-05-25 17:58:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12876546608960470855
Running compilation step : cd /tmp/ltsmin12876546608960470855;'/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 132 ms.
Running link step : cd /tmp/ltsmin12876546608960470855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12876546608960470855;'/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/stateBased16507753478576273739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-25 17:58:49] [INFO ] Invariant cache hit.
[2024-05-25 17:58:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 17:58:49] [INFO ] Invariant cache hit.
[2024-05-25 17:58:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-25 17:58:49] [INFO ] Invariant cache hit.
[2024-05-25 17:58:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 11/11 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin16024944493833173869
[2024-05-25 17:58:49] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16024944493833173869
Running compilation step : cd /tmp/ltsmin16024944493833173869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin16024944493833173869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16024944493833173869;'/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/stateBased7789349253631870917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:59:05] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:59:05] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:59:05] [INFO ] Time to serialize gal into /tmp/LTL3061776421353669877.gal : 0 ms
[2024-05-25 17:59:05] [INFO ] Time to serialize properties into /tmp/LTL62050395065359315.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/LTL3061776421353669877.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13564149254680471492.hoa' '-atoms' '/tmp/LTL62050395065359315.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...316
Loading property file /tmp/LTL62050395065359315.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13564149254680471492.hoa
Detected timeout of ITS tools.
[2024-05-25 17:59:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:59:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:59:20] [INFO ] Time to serialize gal into /tmp/LTL16030015251962141464.gal : 1 ms
[2024-05-25 17:59:20] [INFO ] Time to serialize properties into /tmp/LTL12698071007013592576.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/LTL16030015251962141464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12698071007013592576.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(p13>=2)")||(((G("(p6<=p15)"))&&(X("(p18<=p10)")))&&(("(p18>=1)")||(F("(p13>=2)")))))))
Formula 0 simplified : G(!"(p13>=2)" & (F!"(p6<=p15)" | X!"(p18<=p10)" | (!"(p18>=1)" & G!"(p13>=2)")))
Detected timeout of ITS tools.
[2024-05-25 17:59:35] [INFO ] Flatten gal took : 1 ms
[2024-05-25 17:59:35] [INFO ] Applying decomposition
[2024-05-25 17:59:35] [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/graph17744245041421613320.txt' '-o' '/tmp/graph17744245041421613320.bin' '-w' '/tmp/graph17744245041421613320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17744245041421613320.bin' '-l' '-1' '-v' '-w' '/tmp/graph17744245041421613320.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:59:35] [INFO ] Decomposing Gal with order
[2024-05-25 17:59:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:59:35] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 17:59:35] [INFO ] Time to serialize gal into /tmp/LTL5415911001522006641.gal : 0 ms
[2024-05-25 17:59:35] [INFO ] Time to serialize properties into /tmp/LTL1198635767120039479.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/LTL5415911001522006641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1198635767120039479.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(("(gu0.p13>=2)")||(((G("(gu1.p6<=gu1.p15)"))&&(X("(gu2.p18<=gu2.p10)")))&&(("(gu2.p18>=1)")||(F("(gu0.p13>=2)")))))))
Formula 0 simplified : G(!"(gu0.p13>=2)" & (F!"(gu1.p6<=gu1.p15)" | X!"(gu2.p18<=gu2.p10)" | (!"(gu2.p18>=1)" & G!"(gu0.p13>=2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5692129587405071893
[2024-05-25 17:59:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5692129587405071893
Running compilation step : cd /tmp/ltsmin5692129587405071893;'/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/ltsmin5692129587405071893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5692129587405071893;'/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))&&X((LTLAPp2==true))&&((LTLAPp3==true)||<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00100-LTLCardinality-14 finished in 100016 ms.
[2024-05-25 18:00:05] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2535754070302708040
[2024-05-25 18:00:05] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 18:00:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:00:05] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 18:00:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:00:05] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 18:00:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:00:05] [INFO ] Applying decomposition
[2024-05-25 18:00:05] [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/graph14339550161362781565.txt' '-o' '/tmp/graph14339550161362781565.bin' '-w' '/tmp/graph14339550161362781565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14339550161362781565.bin' '-l' '-1' '-v' '-w' '/tmp/graph14339550161362781565.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:00:05] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2535754070302708040
Running compilation step : cd /tmp/ltsmin2535754070302708040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 18:00:05] [INFO ] Decomposing Gal with order
[2024-05-25 18:00:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:00:05] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:00:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 18:00:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality16232235073737598153.gal : 1 ms
[2024-05-25 18:00:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality4830133327979536328.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/LTLCardinality16232235073737598153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4830133327979536328.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 4 LTL properties
Checking formula 0 : !((F(G(("(gu6.p21<1)")||(X(F(("(gu6.p21<1)")&&(F("(gu8.p26>gu8.p23)")))))))))
Formula 0 simplified : G(F!"(gu6.p21<1)" & F(G!"(gu8.p26>gu8.p23)" | G!"(gu6.p21<1)"))
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin2535754070302708040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2535754070302708040;'/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(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: <>([](((LTLAPp0==true)||X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))))
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: "<>([](((LTLAPp0==true)||X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.026: There are 28 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.026: State length is 27, there are 26 groups
pins2lts-mc-linux64( 0/ 8), 0.026: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.026: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.027: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.027: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.032: [Blue] ~83 levels ~960 states ~2112 transitions
pins2lts-mc-linux64( 0/ 8), 0.064: [Blue] ~213 levels ~1920 states ~6232 transitions
pins2lts-mc-linux64( 1/ 8), 0.113: [Blue] ~378 levels ~3840 states ~11096 transitions
pins2lts-mc-linux64( 1/ 8), 0.203: [Blue] ~759 levels ~7680 states ~22288 transitions
pins2lts-mc-linux64( 1/ 8), 0.384: [Blue] ~1537 levels ~15360 states ~46048 transitions
pins2lts-mc-linux64( 0/ 8), 0.555: [Blue] ~1800 levels ~30720 states ~99080 transitions
pins2lts-mc-linux64( 1/ 8), 0.837: [Blue] ~1800 levels ~61440 states ~218504 transitions
pins2lts-mc-linux64( 1/ 8), 1.303: [Blue] ~1800 levels ~122880 states ~423424 transitions
pins2lts-mc-linux64( 1/ 8), 2.056: [Blue] ~1800 levels ~245760 states ~894968 transitions
pins2lts-mc-linux64( 5/ 8), 3.201: [Blue] ~1788 levels ~491520 states ~1815952 transitions
pins2lts-mc-linux64( 5/ 8), 4.495: [Blue] ~1788 levels ~983040 states ~3659024 transitions
pins2lts-mc-linux64( 4/ 8), 6.141: [Blue] ~1793 levels ~1966080 states ~7325528 transitions
pins2lts-mc-linux64( 6/ 8), 8.887: [Blue] ~1793 levels ~3932160 states ~14894312 transitions
pins2lts-mc-linux64( 4/ 8), 14.428: [Blue] ~1793 levels ~7864320 states ~29981472 transitions
pins2lts-mc-linux64( 6/ 8), 26.904: [Blue] ~1793 levels ~15728640 states ~64197040 transitions
pins2lts-mc-linux64( 2/ 8), 53.202: [Blue] ~1796 levels ~31457280 states ~118137448 transitions
pins2lts-mc-linux64( 6/ 8), 108.428: [Blue] ~1793 levels ~62914560 states ~294763816 transitions
pins2lts-mc-linux64( 2/ 8), 233.176: [Blue] ~1796 levels ~125829120 states ~571737120 transitions
pins2lts-mc-linux64( 0/ 8), 354.941: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 354.970:
pins2lts-mc-linux64( 0/ 8), 354.970: Explored 149486873 states 845400970 transitions, fanout: 5.655
pins2lts-mc-linux64( 0/ 8), 354.970: Total exploration time 354.930 sec (354.900 sec minimum, 354.914 sec on average)
pins2lts-mc-linux64( 0/ 8), 354.970: States per second: 421173, Transitions per second: 2381881
pins2lts-mc-linux64( 0/ 8), 354.970:
pins2lts-mc-linux64( 0/ 8), 354.970: State space has 134217082 states, 67484945 are accepting
pins2lts-mc-linux64( 0/ 8), 354.970: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 354.970: blue states: 149486873 (111.38%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 354.970: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 354.970: all-red states: 67484945 (50.28%), bogus 698199 (0.52%)
pins2lts-mc-linux64( 0/ 8), 354.970:
pins2lts-mc-linux64( 0/ 8), 354.970: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 354.970:
pins2lts-mc-linux64( 0/ 8), 354.970: Queue width: 8B, total height: 14356, memory: 0.11MB
pins2lts-mc-linux64( 0/ 8), 354.970: Tree memory: 1092.4MB, 8.5 B/state, compr.: 7.8%
pins2lts-mc-linux64( 0/ 8), 354.970: Tree fill ratio (roots/leafs): 99.0%/26.0%
pins2lts-mc-linux64( 0/ 8), 354.970: Stored 20 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 354.970: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 354.970: Est. total memory use: 1092.5MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2535754070302708040;'/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(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2535754070302708040;'/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(<>(((LTLAPp0==true)&&<>((LTLAPp1==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 18:23:25] [INFO ] Flatten gal took : 1226 ms
[2024-05-25 18:23:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality18204168153075113565.gal : 62 ms
[2024-05-25 18:23:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality17705362300535271400.ltl : 16 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/LTLCardinality18204168153075113565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17705362300535271400.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...299
Read 4 LTL properties
Checking formula 0 : !((F(G(("(p21<1)")||(X(F(("(p21<1)")&&(F("(p26>p23)")))))))))
Formula 0 simplified : G(F!"(p21<1)" & F(G!"(p26>p23)" | G!"(p21<1)"))
Detected timeout of ITS tools.
[2024-05-25 18:46:46] [INFO ] Flatten gal took : 215 ms
[2024-05-25 18:46:47] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-25 18:46:47] [INFO ] Transformed 26 places.
[2024-05-25 18:46:47] [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 18:46:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality16046912721939480037.gal : 8 ms
[2024-05-25 18:46:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality3292396589851520149.ltl : 13 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/LTLCardinality16046912721939480037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3292396589851520149.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(p21<1)")||(X(F(("(p21<1)")&&(F("(p26>p23)")))))))))
Formula 0 simplified : G(F!"(p21<1)" & F(G!"(p26>p23)" | G!"(p21<1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12820420 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15953456 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-00100"
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-00100, 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-171649597900117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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