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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.9K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-00020-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716658217654

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-00020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 17:30:20] [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:30:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:30:20] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-25 17:30:20] [INFO ] Transformed 26 places.
[2024-05-25 17:30:20] [INFO ] Transformed 18 transitions.
[2024-05-25 17:30:20] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00020-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 17 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:30:20] [INFO ] Computed 8 invariants in 5 ms
[2024-05-25 17:30:20] [INFO ] Implicit Places using invariants in 184 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2024-05-25 17:30:20] [INFO ] Flatten gal took : 23 ms
[2024-05-25 17:30:21] [INFO ] Flatten gal took : 14 ms
[2024-05-25 17:30:21] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10001 steps, including 26 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 30) seen :29
Finished Best-First random walk after 1159 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 1 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(p0)) U p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction 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 4 rules applied. Total rules applied 4 place count 22 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 19 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 17 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 17 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 15 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 3 with 2 rules applied. Total rules applied 17 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 13 transition count 8
Applied a total of 18 rules in 24 ms. Remains 13 /25 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-05-25 17:30:21] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 17:30:21] [INFO ] Implicit Places using invariants in 49 ms returned [0, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 11/25 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 288 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (AND (LEQ s6 s8) (LEQ 3 s2))) (LEQ s6 s8)), p0:(LEQ s3 s2)], 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 1876 reset in 356 ms.
Product exploration explored 100000 steps with 1931 reset in 248 ms.
Computed a total of 11 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 11 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 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-25 17:30:23] [INFO ] Computed 3 invariants in 2 ms
[2024-05-25 17:30:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 17:30:23] [INFO ] Invariant cache hit.
[2024-05-25 17:30:23] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-25 17:30:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:30:23] [INFO ] Invariant cache hit.
[2024-05-25 17:30:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 11 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 8
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2530 reset in 172 ms.
Product exploration explored 100000 steps with 2395 reset in 145 ms.
Built C files in :
/tmp/ltsmin12365945298462643663
[2024-05-25 17:30:24] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-25 17:30:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:30:24] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-25 17:30:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:30:24] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-25 17:30:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:30:24] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12365945298462643663
Running compilation step : cd /tmp/ltsmin12365945298462643663;'/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 276 ms.
Running link step : cd /tmp/ltsmin12365945298462643663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12365945298462643663;'/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/stateBased7933022910493900125.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Applied a total of 1 rules in 8 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 17:30:39] [INFO ] Computed 3 invariants in 2 ms
[2024-05-25 17:30:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-25 17:30:39] [INFO ] Invariant cache hit.
[2024-05-25 17:30:40] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-25 17:30:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:30:40] [INFO ] Invariant cache hit.
[2024-05-25 17:30:40] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 9/11 places, 6/8 transitions.
Built C files in :
/tmp/ltsmin8841622241248607152
[2024-05-25 17:30:40] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 17:30:40] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:30:40] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 17:30:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:30:40] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 17:30:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:30:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8841622241248607152
Running compilation step : cd /tmp/ltsmin8841622241248607152;'/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 114 ms.
Running link step : cd /tmp/ltsmin8841622241248607152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8841622241248607152;'/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/stateBased16009654606733375480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:30:55] [INFO ] Flatten gal took : 3 ms
[2024-05-25 17:30:55] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:30:55] [INFO ] Time to serialize gal into /tmp/LTL17277486207680052209.gal : 1 ms
[2024-05-25 17:30:55] [INFO ] Time to serialize properties into /tmp/LTL6367078599626691069.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/LTL17277486207680052209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9351602984415237808.hoa' '-atoms' '/tmp/LTL6367078599626691069.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/LTL6367078599626691069.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9351602984415237808.hoa
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...162
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 17:31:10] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:31:10] [INFO ] Flatten gal took : 6 ms
[2024-05-25 17:31:10] [INFO ] Time to serialize gal into /tmp/LTL15775746075374685340.gal : 1 ms
[2024-05-25 17:31:10] [INFO ] Time to serialize properties into /tmp/LTL11800809021312488720.ltl : 2 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/LTL15775746075374685340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11800809021312488720.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((F(X("(p9<=p15)")))U("((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))")))))
Formula 0 simplified : GF(!"((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))" & X(!"((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))" W G!"(p9<=p15)"))
Detected timeout of ITS tools.
[2024-05-25 17:31:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:31:25] [INFO ] Applying decomposition
[2024-05-25 17:31:25] [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/graph1126552183269932425.txt' '-o' '/tmp/graph1126552183269932425.bin' '-w' '/tmp/graph1126552183269932425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1126552183269932425.bin' '-l' '-1' '-v' '-w' '/tmp/graph1126552183269932425.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:31:25] [INFO ] Decomposing Gal with order
[2024-05-25 17:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:31:25] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 17:31:25] [INFO ] Time to serialize gal into /tmp/LTL8296718119363193355.gal : 1 ms
[2024-05-25 17:31:25] [INFO ] Time to serialize properties into /tmp/LTL1116660178173818811.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/LTL8296718119363193355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1116660178173818811.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(G((F(X("(gu0.p9<=gu0.p15)")))U("((!((gu1.p27<=gu1.p21)&&(gu0.p15>=3)))&&(gu1.p27<=gu1.p21))")))))
Formula 0 simplified : GF(!"((!((gu1.p27<=gu1.p21)&&(gu0.p15>=3)))&&(gu1.p27<=gu1.p21))" & X(!"((!((gu1.p27<=gu1.p21)&&(gu0.p15>=3)))&&(gu1.p27<=gu1.p21))"...181
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14072260026769524131
[2024-05-25 17:31:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14072260026769524131
Running compilation step : cd /tmp/ltsmin14072260026769524131;'/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 88 ms.
Running link step : cd /tmp/ltsmin14072260026769524131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14072260026769524131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>(X((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00020-LTLCardinality-00 finished in 93947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-25 17:31:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 17:31:55] [INFO ] Implicit Places using invariants in 48 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 54 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2702 reset in 129 ms.
Product exploration explored 100000 steps with 2528 reset in 130 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00020-LTLCardinality-01 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(p1 U X(X(p2)))) U p3)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-05-25 17:31:56] [INFO ] Invariant cache hit.
[2024-05-25 17:31:56] [INFO ] Implicit Places using invariants in 34 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p3), (NOT p3), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(LEQ 2 s16), p0:(LEQ 1 s19), p1:(AND (LEQ s8 s15) (LEQ 2 s16)), p2:(LEQ s8 s15)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-02 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 17:31:56] [INFO ] Computed 6 invariants in 2 ms
[2024-05-25 17:31:56] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s17 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00020-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00020-LTLCardinality-03 finished in 419 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 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 12 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 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 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 8 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 8 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 4 transition count 4
Applied a total of 13 rules in 6 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-25 17:31:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 17:31:57] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 17:31:57] [INFO ] Invariant cache hit.
[2024-05-25 17:31:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-25 17:31:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:31:57] [INFO ] Invariant cache hit.
[2024-05-25 17:31:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-04 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 s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-04 finished in 125 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 19 transition count 12
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 15 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 15 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 10 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 9 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 21 place count 9 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 23 place count 8 transition count 6
Applied a total of 23 rules in 7 ms. Remains 8 /25 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 17:31:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 17:31:57] [INFO ] Implicit Places using invariants in 28 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 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 37 ms. Remains : 6/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GT 1 s4) (GT 1 s5)), p0:(GT 1 s1), p1:(LEQ 1 s4)], 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 826 reset in 165 ms.
Product exploration explored 100000 steps with 826 reset in 227 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0)))), (X (OR (AND (NOT p2) p1) (NOT p0))), (F (G p2)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND p2 p0) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (OR (AND (NOT p2) p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00020-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00020-LTLCardinality-07 finished in 690 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)||(p0&&G(F(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 17 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.
Discarding 1 places :
Implicit places reduction 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 4 rules applied. Total rules applied 5 place count 14 transition count 9
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 17 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 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 3 with 2 rules applied. Total rules applied 19 place count 5 transition count 4
Applied a total of 19 rules in 11 ms. Remains 5 /25 variables (removed 20) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 17:31:57] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 17:31:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 17:31:57] [INFO ] Invariant cache hit.
[2024-05-25 17:31:57] [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:31:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:31:57] [INFO ] Invariant cache hit.
[2024-05-25 17:31:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 s3), p1:(GT 3 s1)], 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]]
Product exploration explored 100000 steps with 2047 reset in 73 ms.
Product exploration explored 100000 steps with 2018 reset in 82 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00020-LTLCardinality-09 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-25 17:31:58] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 17:31:58] [INFO ] Implicit Places using invariants in 46 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 51 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 1 s3), p1:(GT 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-10 finished in 252 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((G(((!(p0 U p1)&&!p0)||X(!p0)))||p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-05-25 17:31:58] [INFO ] Invariant cache hit.
[2024-05-25 17:31:58] [INFO ] Implicit Places using invariants in 41 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 51 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, false, p0]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 1 s17), p1:(LEQ 3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-11 finished in 210 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&&(F(p1)||G(p2))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction 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 4 rules applied. Total rules applied 5 place count 19 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 13 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 12 transition count 9
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 17 place count 11 transition count 9
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 19 place count 10 transition count 8
Applied a total of 19 rules in 7 ms. Remains 10 /25 variables (removed 15) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-25 17:31:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 17:31:58] [INFO ] Implicit Places using invariants in 29 ms returned [1, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 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 40 ms. Remains : 8/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ 3 s7), p2:(LEQ s6 s4)], nbAcceptance=2, 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 1742 steps with 16 reset in 2 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-12 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G((X(G(p0))||(p1 U p0)))) U X(G(!p0))))'
Support contains 1 out of 25 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 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 13 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction 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 4 rules applied. Total rules applied 5 place count 11 transition count 7
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 9 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 7 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 7 transition count 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 17 place count 3 transition count 3
Applied a total of 17 rules in 7 ms. Remains 3 /25 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 17:31:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 17:31:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 17:31:59] [INFO ] Invariant cache hit.
[2024-05-25 17:31:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-25 17:31:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:31:59] [INFO ] Invariant cache hit.
[2024-05-25 17:31:59] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/25 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 3/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-13 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-25 17:31:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 17:31:59] [INFO ] Implicit Places using invariants in 49 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 52 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(GT 2 s3), p2:(AND (GT s20 s12) (NOT (AND (LEQ s13 s17) (LEQ s20 s12) (LEQ 2 s3)))), p1:(AND (LEQ s13 s17) (LEQ s20 s12) (LEQ 2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 441 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 127 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 799 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
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.
// Phase 1: matrix 18 rows 22 cols
[2024-05-25 17:32:01] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 17:32:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 17:32:01] [INFO ] Invariant cache hit.
[2024-05-25 17:32:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-25 17:32:01] [INFO ] Invariant cache hit.
[2024-05-25 17:32:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 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 p0 (NOT p1) (NOT p2)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 127 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 22 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 22 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 20 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 20 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 20 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 19 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 19 transition count 15
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 15 rules in 9 ms. Remains 19 /22 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2024-05-25 17:32:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2024-05-25 17:32:03] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 17:32:03] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/22 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 19/22 places, 15/18 transitions.
Built C files in :
/tmp/ltsmin16834153699844960199
[2024-05-25 17:32:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16834153699844960199
Running compilation step : cd /tmp/ltsmin16834153699844960199;'/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 106 ms.
Running link step : cd /tmp/ltsmin16834153699844960199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16834153699844960199;'/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/stateBased6321208124102588833.hoa' '--buchi-type=spotba'
LTSmin run took 158 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00020-LTLCardinality-14 finished in 4860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
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 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 6
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 8 transition count 4
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 8 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 4 transition count 4
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 4 transition count 3
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 3 transition count 3
Applied a total of 11 rules in 6 ms. Remains 3 /25 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 17:32:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 17:32:04] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 17:32:04] [INFO ] Invariant cache hit.
[2024-05-25 17:32:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-25 17:32:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 17:32:04] [INFO ] Invariant cache hit.
[2024-05-25 17:32:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/25 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 3/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 323 steps with 52 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLCardinality-15 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(G((F(X(p0)) U p1))))'
[2024-05-25 17:32:04] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15079728833919347064
[2024-05-25 17:32:04] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 17:32:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:32:04] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 17:32:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:32:04] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 17:32:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 17:32:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15079728833919347064
Running compilation step : cd /tmp/ltsmin15079728833919347064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 17:32:04] [INFO ] Applying decomposition
[2024-05-25 17:32:04] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11952316815034088634.txt' '-o' '/tmp/graph11952316815034088634.bin' '-w' '/tmp/graph11952316815034088634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11952316815034088634.bin' '-l' '-1' '-v' '-w' '/tmp/graph11952316815034088634.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:32:04] [INFO ] Decomposing Gal with order
[2024-05-25 17:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:32:04] [INFO ] Flatten gal took : 4 ms
[2024-05-25 17:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 17:32:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality8488966662183353714.gal : 1 ms
[2024-05-25 17:32:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality6096693956406495183.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/LTLCardinality8488966662183353714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6096693956406495183.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G((F(X("(gu3.p9<=gu3.p15)")))U("((!((gu7.p27<=gu7.p21)&&(gu3.p15>=3)))&&(gu7.p27<=gu7.p21))")))))
Formula 0 simplified : GF(!"((!((gu7.p27<=gu7.p21)&&(gu3.p15>=3)))&&(gu7.p27<=gu7.p21))" & X(!"((!((gu7.p27<=gu7.p21)&&(gu3.p15>=3)))&&(gu7.p27<=gu7.p21))"...181
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin15079728833919347064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15079728833919347064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>(X((LTLAPp0==true))) U (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( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: <>([]((<>(X((LTLAPp0==true))) U (LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: "<>([]((<>(X((LTLAPp0==true))) U (LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.019: State length is 26, there are 26 groups
pins2lts-mc-linux64( 0/ 8), 0.019: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.019: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.019: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.019: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.061: [Blue] ~120 levels ~960 states ~3744 transitions
pins2lts-mc-linux64( 5/ 8), 0.109: [Blue] ~240 levels ~1920 states ~6552 transitions
pins2lts-mc-linux64( 3/ 8), 0.158: [Blue] ~353 levels ~3840 states ~9560 transitions
pins2lts-mc-linux64( 4/ 8), 0.207: [Blue] ~290 levels ~7680 states ~14080 transitions
pins2lts-mc-linux64( 3/ 8), 0.308: [Blue] ~353 levels ~15360 states ~38264 transitions
pins2lts-mc-linux64( 6/ 8), 0.457: [Blue] ~318 levels ~30720 states ~58872 transitions
pins2lts-mc-linux64( 6/ 8), 0.769: [Blue] ~326 levels ~61440 states ~115416 transitions
pins2lts-mc-linux64( 6/ 8), 1.248: [Blue] ~334 levels ~122880 states ~230608 transitions
pins2lts-mc-linux64( 6/ 8), 2.047: [Blue] ~345 levels ~245760 states ~465424 transitions
pins2lts-mc-linux64( 6/ 8), 3.070: [Blue] ~350 levels ~491520 states ~1037992 transitions
pins2lts-mc-linux64( 4/ 8), 4.356: [Blue] ~344 levels ~983040 states ~2258168 transitions
pins2lts-mc-linux64( 6/ 8), 5.823: [Blue] ~350 levels ~1966080 states ~5143648 transitions
pins2lts-mc-linux64( 4/ 8), 8.312: [Blue] ~344 levels ~3932160 states ~10847472 transitions
pins2lts-mc-linux64( 4/ 8), 13.454: [Blue] ~344 levels ~7864320 states ~22165792 transitions
pins2lts-mc-linux64( 4/ 8), 26.951: [Blue] ~344 levels ~15728640 states ~47762400 transitions
pins2lts-mc-linux64( 4/ 8), 57.112: [Blue] ~344 levels ~31457280 states ~101264992 transitions
pins2lts-mc-linux64( 6/ 8), 119.410: [Blue] ~350 levels ~62914560 states ~221745392 transitions
pins2lts-mc-linux64( 3/ 8), 214.709: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 214.814:
pins2lts-mc-linux64( 0/ 8), 214.814: Explored 74587979 states 367493002 transitions, fanout: 4.927
pins2lts-mc-linux64( 0/ 8), 214.814: Total exploration time 214.710 sec (214.660 sec minimum, 214.691 sec on average)
pins2lts-mc-linux64( 0/ 8), 214.814: States per second: 347389, Transitions per second: 1711578
pins2lts-mc-linux64( 0/ 8), 214.814:
pins2lts-mc-linux64( 0/ 8), 214.814: State space has 73718687 states, 50231689 are accepting
pins2lts-mc-linux64( 0/ 8), 214.814: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 214.814: blue states: 74587979 (101.18%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 214.814: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 214.814: all-red states: 61369253 (83.25%), bogus 203337 (0.28%)
pins2lts-mc-linux64( 0/ 8), 214.814:
pins2lts-mc-linux64( 0/ 8), 214.814: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 214.814:
pins2lts-mc-linux64( 0/ 8), 214.814: Queue width: 8B, total height: 2828, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 214.814: Tree memory: 818.4MB, 11.6 B/state, compr.: 11.0%
pins2lts-mc-linux64( 0/ 8), 214.814: Tree fill ratio (roots/leafs): 54.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 214.814: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 214.814: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 214.814: Est. total memory use: 818.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15079728833919347064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>(X((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15079728833919347064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>(X((LTLAPp0==true))) U (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)
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 17:52:38] [INFO ] Flatten gal took : 2 ms
[2024-05-25 17:52:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality8359804446952886601.gal : 2 ms
[2024-05-25 17:52:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality5822002390933818118.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/LTLCardinality8359804446952886601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5822002390933818118.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G((F(X("(p9<=p15)")))U("((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))")))))
Formula 0 simplified : GF(!"((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))" & X(!"((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))" W G!"(p9<=p15)"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 18:13:12] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:13:12] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-25 18:13:12] [INFO ] Transformed 25 places.
[2024-05-25 18:13:12] [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:13:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality8612135158789331860.gal : 0 ms
[2024-05-25 18:13:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality11858683527836465371.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/LTLCardinality8612135158789331860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11858683527836465371.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((F(X("(p9<=p15)")))U("((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))")))))
Formula 0 simplified : GF(!"((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))" & X(!"((!((p27<=p21)&&(p15>=3)))&&(p27<=p21))" W G!"(p9<=p15)"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11970384 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16040860 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-00020"
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-00020, 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-171649597900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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