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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 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.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:01 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:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716678270974

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-16000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 23:04:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 23:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:04:34] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2024-05-25 23:04:34] [INFO ] Transformed 26 places.
[2024-05-25 23:04:34] [INFO ] Transformed 18 transitions.
[2024-05-25 23:04:34] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-16000-LTLFireability-05 FALSE 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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 14 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:04:34] [INFO ] Computed 7 invariants in 8 ms
[2024-05-25 23:04:34] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-25 23:04:34] [INFO ] Invariant cache hit.
[2024-05-25 23:04:34] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-25 23:04:34] [INFO ] Invariant cache hit.
[2024-05-25 23:04:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2024-05-25 23:04:35] [INFO ] Flatten gal took : 32 ms
[2024-05-25 23:04:35] [INFO ] Flatten gal took : 9 ms
[2024-05-25 23:04:35] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=500 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 23:04:35] [INFO ] Invariant cache hit.
[2024-05-25 23:04:35] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-25 23:04:35] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 23:04:35] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-25 23:04:35] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 16000 steps, including 0 resets, run visited all 1 properties in 194 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 195 ms.
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' '!(X(X(X(F(p0)))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:04:36] [INFO ] Invariant cache hit.
[2024-05-25 23:04:36] [INFO ] Implicit Places using invariants in 70 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 21/25 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-00 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:(GEQ s4 1)], 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 15122 reset in 447 ms.
Product exploration explored 100000 steps with 15135 reset in 227 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1600 ) properties (out of 1) seen :0
Finished Best-First random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 23:04:38] [INFO ] Computed 3 invariants in 3 ms
[2024-05-25 23:04:38] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:04:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 23:04:38] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 23:04:38] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:04:38] [INFO ] Invariant cache hit.
[2024-05-25 23:04:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-25 23:04:38] [INFO ] Invariant cache hit.
[2024-05-25 23:04:38] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-25 23:04:38] [INFO ] Invariant cache hit.
[2024-05-25 23:04:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 23:04:39] [INFO ] Invariant cache hit.
[2024-05-25 23:04:39] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:04:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:04:39] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:04:39] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15042 reset in 138 ms.
Product exploration explored 100000 steps with 15100 reset in 172 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 4 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 11 ms. Remains 3 /21 variables (removed 18) and now considering 3/18 (removed 15) transitions.
[2024-05-25 23:04:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2024-05-25 23:04:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:04:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/21 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 3/21 places, 3/18 transitions.
Built C files in :
/tmp/ltsmin2685979711787467554
[2024-05-25 23:04:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2685979711787467554
Running compilation step : cd /tmp/ltsmin2685979711787467554;'/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 230 ms.
Running link step : cd /tmp/ltsmin2685979711787467554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2685979711787467554;'/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/stateBased1052521588536360524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 23:04:55] [INFO ] Computed 3 invariants in 2 ms
[2024-05-25 23:04:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-25 23:04:55] [INFO ] Invariant cache hit.
[2024-05-25 23:04:55] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-25 23:04:55] [INFO ] Invariant cache hit.
[2024-05-25 23:04:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin12987714886809043751
[2024-05-25 23:04:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12987714886809043751
Running compilation step : cd /tmp/ltsmin12987714886809043751;'/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 99 ms.
Running link step : cd /tmp/ltsmin12987714886809043751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12987714886809043751;'/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/stateBased9341441429263297971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 23:05:10] [INFO ] Flatten gal took : 14 ms
[2024-05-25 23:05:10] [INFO ] Flatten gal took : 3 ms
[2024-05-25 23:05:10] [INFO ] Time to serialize gal into /tmp/LTL7083477074476222146.gal : 1 ms
[2024-05-25 23:05:10] [INFO ] Time to serialize properties into /tmp/LTL3183040923143550452.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7083477074476222146.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13195952970034187439.hoa' '-atoms' '/tmp/LTL3183040923143550452.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/LTL3183040923143550452.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13195952970034187439.hoa
Detected timeout of ITS tools.
[2024-05-25 23:05:25] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:05:25] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:05:25] [INFO ] Time to serialize gal into /tmp/LTL5007930991166852684.gal : 2 ms
[2024-05-25 23:05:25] [INFO ] Time to serialize properties into /tmp/LTL3842133583902344554.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/LTL5007930991166852684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3842133583902344554.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p5>=1)"))))))
Formula 0 simplified : XXXG!"(p5>=1)"
Detected timeout of ITS tools.
[2024-05-25 23:05:40] [INFO ] Flatten gal took : 3 ms
[2024-05-25 23:05:40] [INFO ] Applying decomposition
[2024-05-25 23:05:40] [INFO ] Flatten gal took : 5 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/graph7480208449459682765.txt' '-o' '/tmp/graph7480208449459682765.bin' '-w' '/tmp/graph7480208449459682765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7480208449459682765.bin' '-l' '-1' '-v' '-w' '/tmp/graph7480208449459682765.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:05:41] [INFO ] Decomposing Gal with order
[2024-05-25 23:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:05:41] [INFO ] Flatten gal took : 54 ms
[2024-05-25 23:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 23:05:41] [INFO ] Time to serialize gal into /tmp/LTL12979836722527420699.gal : 1 ms
[2024-05-25 23:05:41] [INFO ] Time to serialize properties into /tmp/LTL10253757572413624073.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/LTL12979836722527420699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10253757572413624073.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i0.u2.p5>=1)"))))))
Formula 0 simplified : XXXG!"(i0.u2.p5>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2497637094661094752
[2024-05-25 23:05:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2497637094661094752
Running compilation step : cd /tmp/ltsmin2497637094661094752;'/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 159 ms.
Running link step : cd /tmp/ltsmin2497637094661094752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2497637094661094752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-16000-LTLFireability-00 finished in 95194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:06:11] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 23:06:11] [INFO ] Implicit Places using invariants in 63 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 ms to find 4 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 67 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9580 reset in 133 ms.
Product exploration explored 100000 steps with 9602 reset in 94 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 23:06:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 23:06:12] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:06:12] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:12] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 23:06:12] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:06:12] [INFO ] Added : 17 causal constraints over 4 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 5 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
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 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 2 transition count 2
Applied a total of 5 rules in 2843 ms. Remains 2 /21 variables (removed 19) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 23:06:15] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:06:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 23:06:15] [INFO ] Invariant cache hit.
[2024-05-25 23:06:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-25 23:06:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:06:15] [INFO ] Invariant cache hit.
[2024-05-25 23:06:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2928 ms. Remains : 2/21 places, 2/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-01 finished in 4057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(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.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:06:15] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 23:06:15] [INFO ] Implicit Places using invariants in 41 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 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 44 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s12 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Product exploration explored 100000 steps with 0 reset in 378 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-02 finished in 770 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||G(F(p1)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:06:16] [INFO ] Invariant cache hit.
[2024-05-25 23:06:16] [INFO ] Implicit Places using invariants in 50 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 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 55 ms. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s20 1)), p1:(OR (AND (GEQ s19 1) (GEQ s20 1)) (LT s7 1) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2692 reset in 210 ms.
Product exploration explored 100000 steps with 3036 reset in 229 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 : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-03 finished in 811 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)))'
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 7 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 4
Applied a total of 5 rules in 2194 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 23:06:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:06:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 23:06:19] [INFO ] Invariant cache hit.
[2024-05-25 23:06:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 23:06:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:06:19] [INFO ] Invariant cache hit.
[2024-05-25 23:06:19] [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 2263 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(LT s3 1)], 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 1 reset in 100 ms.
Product exploration explored 100000 steps with 1 reset in 140 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X p1), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-04 finished in 2749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1&&X(p2)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:06:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 23:06:19] [INFO ] Implicit Places using invariants in 51 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/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 57 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s4 1), p2:(GEQ s5 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14763 reset in 230 ms.
Product exploration explored 100000 steps with 14886 reset in 291 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 8 factoid took 1549 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 8) seen :7
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 2308 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 23:06:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 23:06:25] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:06:25] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:06:25] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-25 23:06:25] [INFO ] Invariant cache hit.
[2024-05-25 23:06:25] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:06:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:06:25] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:25] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:06:25] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:06:25] [INFO ] Added : 17 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:06:25] [INFO ] Invariant cache hit.
[2024-05-25 23:06:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 23:06:25] [INFO ] Invariant cache hit.
[2024-05-25 23:06:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-25 23:06:25] [INFO ] Invariant cache hit.
[2024-05-25 23:06:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 1308 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 8) seen :7
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 2136 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
[2024-05-25 23:06:30] [INFO ] Invariant cache hit.
[2024-05-25 23:06:30] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 23:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:30] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-25 23:06:30] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:06:30] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-25 23:06:30] [INFO ] Invariant cache hit.
[2024-05-25 23:06:30] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:06:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:06:30] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:06:30] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:06:30] [INFO ] Added : 17 causal constraints over 4 iterations in 33 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 14800 reset in 391 ms.
Product exploration explored 100000 steps with 14855 reset in 334 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 6 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 6 /21 variables (removed 15) and now considering 6/18 (removed 12) transitions.
[2024-05-25 23:06:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 23:06:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:06:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 6/21 places, 6/18 transitions.
Built C files in :
/tmp/ltsmin9021918400475414671
[2024-05-25 23:06:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9021918400475414671
Running compilation step : cd /tmp/ltsmin9021918400475414671;'/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 137 ms.
Running link step : cd /tmp/ltsmin9021918400475414671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9021918400475414671;'/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/stateBased18096657694105555711.hoa' '--buchi-type=spotba'
LTSmin run took 5831 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-16000-LTLFireability-06 finished in 18260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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 7 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 3
Applied a total of 4 rules in 9650 ms. Remains 4 /25 variables (removed 21) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-05-25 23:06:47] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 23:06:47] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 23:06:47] [INFO ] Invariant cache hit.
[2024-05-25 23:06:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-25 23:06:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:06:47] [INFO ] Invariant cache hit.
[2024-05-25 23:06:47] [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, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9717 ms. Remains : 4/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24981 reset in 79 ms.
Product exploration explored 100000 steps with 25006 reset in 117 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 1) seen :0
Finished Best-First random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-25 23:06:48] [INFO ] Invariant cache hit.
[2024-05-25 23:06:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 23:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 23:06:48] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:06:48] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-05-25 23:06:48] [INFO ] Invariant cache hit.
[2024-05-25 23:06:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 23:06:48] [INFO ] Invariant cache hit.
[2024-05-25 23:06:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 23:06:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:06:48] [INFO ] Invariant cache hit.
[2024-05-25 23:06:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 4/4 places, 3/3 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Finished Best-First random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-05-25 23:06:49] [INFO ] Invariant cache hit.
[2024-05-25 23:06:49] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 23:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 23:06:49] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:06:49] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25044 reset in 54 ms.
Product exploration explored 100000 steps with 24991 reset in 67 ms.
Built C files in :
/tmp/ltsmin12008545651849353697
[2024-05-25 23:06:49] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2024-05-25 23:06:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:06:49] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2024-05-25 23:06:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:06:49] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2024-05-25 23:06:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:06:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12008545651849353697
Running compilation step : cd /tmp/ltsmin12008545651849353697;'/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 73 ms.
Running link step : cd /tmp/ltsmin12008545651849353697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin12008545651849353697;'/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/stateBased6500831220105229115.hoa' '--buchi-type=spotba'
LTSmin run took 1613 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-16000-LTLFireability-07 finished in 13161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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.
Reduce places removed 1 places and 1 transitions.
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 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 20 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
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 25 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Applied a total of 30 rules in 6636 ms. Remains 6 /25 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-25 23:06:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 23:06:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 23:06:57] [INFO ] Invariant cache hit.
[2024-05-25 23:06:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-25 23:06:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:06:57] [INFO ] Invariant cache hit.
[2024-05-25 23:06:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6726 ms. Remains : 6/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15157 reset in 65 ms.
Product exploration explored 100000 steps with 15065 reset in 80 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-25 23:06:58] [INFO ] Invariant cache hit.
[2024-05-25 23:06:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 23:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:06:58] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:06:58] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:06:58] [INFO ] Invariant cache hit.
[2024-05-25 23:06:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 23:06:58] [INFO ] Invariant cache hit.
[2024-05-25 23:06:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-25 23:06:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:06:58] [INFO ] Invariant cache hit.
[2024-05-25 23:06:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-25 23:06:58] [INFO ] Invariant cache hit.
[2024-05-25 23:06:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 23:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:06:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:06:58] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:06:58] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15149 reset in 69 ms.
Product exploration explored 100000 steps with 15106 reset in 80 ms.
Built C files in :
/tmp/ltsmin10159339478866460936
[2024-05-25 23:06:59] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 23:06:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:06:59] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 23:06:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:06:59] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 23:06:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:06:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10159339478866460936
Running compilation step : cd /tmp/ltsmin10159339478866460936;'/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 75 ms.
Running link step : cd /tmp/ltsmin10159339478866460936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10159339478866460936;'/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/stateBased3187459034406832644.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:07:14] [INFO ] Invariant cache hit.
[2024-05-25 23:07:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 23:07:14] [INFO ] Invariant cache hit.
[2024-05-25 23:07:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 23:07:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:07:14] [INFO ] Invariant cache hit.
[2024-05-25 23:07:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin5523072112585206142
[2024-05-25 23:07:14] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 23:07:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:07:14] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 23:07:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:07:14] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 23:07:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:07:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5523072112585206142
Running compilation step : cd /tmp/ltsmin5523072112585206142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin5523072112585206142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5523072112585206142;'/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/stateBased1912438265351215281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 23:07:29] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:07:29] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:07:29] [INFO ] Time to serialize gal into /tmp/LTL13095544020932732941.gal : 1 ms
[2024-05-25 23:07:29] [INFO ] Time to serialize properties into /tmp/LTL15441336616900154221.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/LTL13095544020932732941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14486115166120226750.hoa' '-atoms' '/tmp/LTL15441336616900154221.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15441336616900154221.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14486115166120226750.hoa
Detected timeout of ITS tools.
[2024-05-25 23:07:44] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:07:44] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:07:44] [INFO ] Time to serialize gal into /tmp/LTL14105533245555055120.gal : 5 ms
[2024-05-25 23:07:44] [INFO ] Time to serialize properties into /tmp/LTL6026429464650392730.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/LTL14105533245555055120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6026429464650392730.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F("(((u0.p27>=1)&&(u1.p26>=1))&&(u2.p25>=1))")))
Formula 0 simplified : G!"(((u0.p27>=1)&&(u1.p26>=1))&&(u2.p25>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13865484191939648458
[2024-05-25 23:08:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13865484191939648458
Running compilation step : cd /tmp/ltsmin13865484191939648458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin13865484191939648458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13865484191939648458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-16000-LTLFireability-08 finished in 98674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 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 4 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 2700 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 23:08:32] [INFO ] Computed 0 invariants in 6 ms
[2024-05-25 23:08:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 23:08:32] [INFO ] Invariant cache hit.
[2024-05-25 23:08:32] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-25 23:08:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:32] [INFO ] Invariant cache hit.
[2024-05-25 23:08:32] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2773 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], 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 3 reset in 166 ms.
Product exploration explored 100000 steps with 3 reset in 272 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-09 finished in 3329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:08:33] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 23:08:33] [INFO ] Implicit Places using invariants in 36 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/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 40 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s17 1) (GEQ s18 1) (GEQ s1 1)), p0:(AND (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-10 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 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 16 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 15 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 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 0 with 2 rules applied. Total rules applied 13 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 6 transition count 5
Applied a total of 16 rules in 2775 ms. Remains 6 /25 variables (removed 19) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-25 23:08:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 23:08:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 23:08:36] [INFO ] Invariant cache hit.
[2024-05-25 23:08:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 23:08:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:36] [INFO ] Invariant cache hit.
[2024-05-25 23:08:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2845 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p1:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 80000 steps with 0 reset in 115 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-11 finished in 3121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 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 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 16 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 14 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 14 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 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 2 with 2 rules applied. Total rules applied 20 place count 5 transition count 4
Applied a total of 20 rules in 2592 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 23:08:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 23:08:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 23:08:39] [INFO ] Invariant cache hit.
[2024-05-25 23:08:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 23:08:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:39] [INFO ] Invariant cache hit.
[2024-05-25 23:08:39] [INFO ] Dead Transitions using invariants and state equation in 25 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 2677 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s4 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 93 reset in 105 ms.
Product exploration explored 100000 steps with 109 reset in 170 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-12 finished in 3122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(p1)&&(G(p0)||G((p0 U p2)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:08:39] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 23:08:39] [INFO ] Implicit Places using invariants in 46 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 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 50 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s20 1), p2:(GEQ s14 1), p1:(GEQ s2 1)], 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 3565 reset in 94 ms.
Product exploration explored 100000 steps with 3582 reset in 105 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 339 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Finished Best-First random walk after 212 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-25 23:08:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 23:08:41] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:08:41] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:08:41] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:08:41] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 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 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 15 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 14 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 11 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 8 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 6 transition count 6
Applied a total of 16 rules in 2580 ms. Remains 6 /21 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-25 23:08:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:08:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 23:08:43] [INFO ] Invariant cache hit.
[2024-05-25 23:08:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-25 23:08:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:43] [INFO ] Invariant cache hit.
[2024-05-25 23:08:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2658 ms. Remains : 6/21 places, 6/18 transitions.
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Finished Best-First random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
[2024-05-25 23:08:44] [INFO ] Invariant cache hit.
[2024-05-25 23:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:08:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:08:44] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:08:44] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13076 reset in 57 ms.
Product exploration explored 100000 steps with 13149 reset in 69 ms.
Built C files in :
/tmp/ltsmin11906813421726309748
[2024-05-25 23:08:44] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-25 23:08:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:44] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-25 23:08:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:44] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-25 23:08:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11906813421726309748
Running compilation step : cd /tmp/ltsmin11906813421726309748;'/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 105 ms.
Running link step : cd /tmp/ltsmin11906813421726309748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11906813421726309748;'/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/stateBased15807755522767714333.hoa' '--buchi-type=spotba'
LTSmin run took 2217 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-16000-LTLFireability-13 finished in 7483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F((p1&&X(F(p2))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-25 23:08:47] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 23:08:47] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 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 34 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s15 1), p2:(GEQ s12 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-14 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(p0)||F(!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 16 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 15 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 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 0 with 2 rules applied. Total rules applied 13 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 6 transition count 5
Applied a total of 16 rules in 2543 ms. Remains 6 /25 variables (removed 19) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-25 23:08:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 23:08:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 23:08:49] [INFO ] Invariant cache hit.
[2024-05-25 23:08:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 23:08:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:49] [INFO ] Invariant cache hit.
[2024-05-25 23:08:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2608 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[p1, (AND p1 (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LT s5 1), p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19621 reset in 63 ms.
Product exploration explored 100000 steps with 19708 reset in 73 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p1]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Finished Best-First random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 467 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p1]
Stuttering acceptance computed with spot in 48 ms :[p1]
[2024-05-25 23:08:51] [INFO ] Invariant cache hit.
[2024-05-25 23:08:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 23:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:08:51] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:08:51] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p1
Support contains 1 out of 6 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 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-25 23:08:51] [INFO ] Invariant cache hit.
[2024-05-25 23:08:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 23:08:51] [INFO ] Invariant cache hit.
[2024-05-25 23:08:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-25 23:08:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:51] [INFO ] Invariant cache hit.
[2024-05-25 23:08:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p1]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Finished Best-First random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p1]
Stuttering acceptance computed with spot in 48 ms :[p1]
[2024-05-25 23:08:51] [INFO ] Invariant cache hit.
[2024-05-25 23:08:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 23:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:08:51] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:08:51] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 39 ms :[p1]
Product exploration explored 100000 steps with 19570 reset in 97 ms.
Product exploration explored 100000 steps with 19666 reset in 120 ms.
Built C files in :
/tmp/ltsmin5044203927832297256
[2024-05-25 23:08:52] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-25 23:08:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:52] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-25 23:08:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:52] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-25 23:08:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5044203927832297256
Running compilation step : cd /tmp/ltsmin5044203927832297256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin5044203927832297256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5044203927832297256;'/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/stateBased15000815984094113090.hoa' '--buchi-type=spotba'
LTSmin run took 1959 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-16000-LTLFireability-15 finished in 6931 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)))))'
Found a Shortening insensitive property : HouseConstruction-PT-16000-LTLFireability-00
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 4 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 2362 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 23:08:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:08:56] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 23:08:56] [INFO ] Invariant cache hit.
[2024-05-25 23:08:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-25 23:08:56] [INFO ] Invariant cache hit.
[2024-05-25 23:08:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2414 ms. Remains : 2/25 places, 2/18 transitions.
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-00 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:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 38 ms.
Product exploration explored 100000 steps with 25000 reset in 47 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 23:08:57] [INFO ] Invariant cache hit.
[2024-05-25 23:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:08:57] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:08:57] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-25 23:08:57] [INFO ] Invariant cache hit.
[2024-05-25 23:08:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 23:08:57] [INFO ] Invariant cache hit.
[2024-05-25 23:08:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 23:08:57] [INFO ] Invariant cache hit.
[2024-05-25 23:08:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 23:08:58] [INFO ] Invariant cache hit.
[2024-05-25 23:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:08:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:08:58] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:08:58] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 66 ms.
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-25 23:08:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:08:59] [INFO ] Invariant cache hit.
[2024-05-25 23:08:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32 ms. Remains : 2/2 places, 2/2 transitions.
Built C files in :
/tmp/ltsmin13487133732691357507
[2024-05-25 23:08:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13487133732691357507
Running compilation step : cd /tmp/ltsmin13487133732691357507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin13487133732691357507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13487133732691357507;'/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/stateBased15060310553875383945.hoa' '--buchi-type=spotba'
LTSmin run took 159 ms.
Treatment of property HouseConstruction-PT-16000-LTLFireability-00 finished in 5601 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-00 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-25 23:08:59] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13159697550082478753
[2024-05-25 23:08:59] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-25 23:08:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:59] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-25 23:08:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:59] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-25 23:08:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:08:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13159697550082478753
Running compilation step : cd /tmp/ltsmin13159697550082478753;'/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 23:08:59] [INFO ] Applying decomposition
[2024-05-25 23:08:59] [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/graph6918111112066902423.txt' '-o' '/tmp/graph6918111112066902423.bin' '-w' '/tmp/graph6918111112066902423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6918111112066902423.bin' '-l' '-1' '-v' '-w' '/tmp/graph6918111112066902423.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:08:59] [INFO ] Decomposing Gal with order
[2024-05-25 23:08:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:08:59] [INFO ] Flatten gal took : 6 ms
[2024-05-25 23:08:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 23:08:59] [INFO ] Time to serialize gal into /tmp/LTLFireability6052781546844083213.gal : 2 ms
[2024-05-25 23:09:00] [INFO ] Time to serialize properties into /tmp/LTLFireability5327758891811912378.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/LTLFireability6052781546844083213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5327758891811912378.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((i4.u6.p27>=1)&&(i4.u7.p26>=1))&&(u9.p25>=1))")))
Formula 0 simplified : G!"(((i4.u6.p27>=1)&&(i4.u7.p26>=1))&&(u9.p25>=1))"
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin13159697550082478753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13159697550082478753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
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: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 20, guards 18
pins2lts-mc-linux64( 4/ 8), 0.002: LTL layer: formula: <>((LTLAPp1==true))
pins2lts-mc-linux64( 4/ 8), 0.002: "<>((LTLAPp1==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.015: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.020: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.020: State length is 26, there are 19 groups
pins2lts-mc-linux64( 0/ 8), 0.020: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.020: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.020: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.020: Visible groups: 0 / 19, labels: 1 / 22
pins2lts-mc-linux64( 0/ 8), 0.020: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.020: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.040: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 0.052: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 4/ 8), 0.072: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.110: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 5/ 8), 0.182: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 1/ 8), 0.311: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 7/ 8), 0.539: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 3/ 8), 0.866: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 7/ 8), 1.387: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 2/ 8), 2.197: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 4/ 8), 3.401: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 1/ 8), 5.678: [Blue] ~239830 levels ~1966080 states ~2171584 transitions
pins2lts-mc-linux64( 7/ 8), 9.623: [Blue] ~255999 levels ~3932160 states ~4920448 transitions
pins2lts-mc-linux64( 7/ 8), 16.039: [Blue] ~255999 levels ~7864320 states ~10818880 transitions
pins2lts-mc-linux64( 7/ 8), 27.751: [Blue] ~255999 levels ~15728640 states ~22615696 transitions
pins2lts-mc-linux64( 7/ 8), 52.491: [Blue] ~255999 levels ~31457280 states ~46209664 transitions
pins2lts-mc-linux64( 6/ 8), 68.680: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 68.741:
pins2lts-mc-linux64( 0/ 8), 68.741: Explored 28353213 states 63467401 transitions, fanout: 2.238
pins2lts-mc-linux64( 0/ 8), 68.741: Total exploration time 68.710 sec (68.620 sec minimum, 68.664 sec on average)
pins2lts-mc-linux64( 0/ 8), 68.741: States per second: 412650, Transitions per second: 923700
pins2lts-mc-linux64( 0/ 8), 68.741:
pins2lts-mc-linux64( 0/ 8), 68.741: State space has 11177605 states, 10831544 are accepting
pins2lts-mc-linux64( 0/ 8), 68.741: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 68.741: blue states: 28353213 (253.66%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 68.741: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 68.741: all-red states: 10831544 (96.90%), bogus 15504356 (138.71%)
pins2lts-mc-linux64( 0/ 8), 68.741:
pins2lts-mc-linux64( 0/ 8), 68.741: Total memory used for local state coloring: 31.2MB
pins2lts-mc-linux64( 0/ 8), 68.741:
pins2lts-mc-linux64( 0/ 8), 68.741: Queue width: 8B, total height: 2047990, memory: 15.62MB
pins2lts-mc-linux64( 0/ 8), 68.741: Tree memory: 341.3MB, 32.0 B/state, compr.: 30.2%
pins2lts-mc-linux64( 0/ 8), 68.741: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 68.741: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 68.741: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 68.741: Est. total memory use: 356.9MB (~1039.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13159697550082478753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13159697550082478753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 23:30:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 23:30:28] [INFO ] Time to serialize gal into /tmp/LTLFireability13529455182905370832.gal : 1 ms
[2024-05-25 23:30:28] [INFO ] Time to serialize properties into /tmp/LTLFireability5788100761115241553.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/LTLFireability13529455182905370832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5788100761115241553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F("(((p27>=1)&&(p26>=1))&&(p25>=1))")))
Formula 0 simplified : G!"(((p27>=1)&&(p26>=1))&&(p25>=1))"
Detected timeout of ITS tools.
[2024-05-25 23:51:57] [INFO ] Flatten gal took : 3 ms
[2024-05-25 23:51:57] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-25 23:51:57] [INFO ] Transformed 25 places.
[2024-05-25 23:51:57] [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 23:51:57] [INFO ] Time to serialize gal into /tmp/LTLFireability5856703530318242887.gal : 1 ms
[2024-05-25 23:51:57] [INFO ] Time to serialize properties into /tmp/LTLFireability2662602868599702737.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/LTLFireability5856703530318242887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2662602868599702737.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(((p27>=1)&&(p26>=1))&&(p25>=1))")))
Formula 0 simplified : G!"(((p27>=1)&&(p26>=1))&&(p25>=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9255432 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16035852 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-16000"
export BK_EXAMINATION="LTLFireability"
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-16000, examination is LTLFireability"
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-171649598000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-16000.tgz
mv HouseConstruction-PT-16000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;