Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251919100836.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N0020P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251919100836
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 7.2K Apr 29 12:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 12:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.1K May 10 09:33 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 ClientsAndServers-PT-N0020P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652698423740

Running Version 202205111006
[2022-05-16 10:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 10:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:53:45] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-16 10:53:45] [INFO ] Transformed 25 places.
[2022-05-16 10:53:45] [INFO ] Transformed 18 transitions.
[2022-05-16 10:53:45] [INFO ] Parsed PT model containing 25 places and 18 transitions in 143 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 3 formulas.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 9 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 10:53:45] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-16 10:53:45] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 10:53:45] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-16 10:53:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 10:53:45] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 10:53:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
Support contains 22 out of 24 places after structural reductions.
[2022-05-16 10:53:45] [INFO ] Flatten gal took : 15 ms
[2022-05-16 10:53:45] [INFO ] Flatten gal took : 4 ms
[2022-05-16 10:53:45] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 1679 steps, including 1 resets, run visited all 18 properties in 28 ms. (steps per millisecond=59 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X((X(p0)&&p1))&&G(p1)) U X(p2)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 10:53:45] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:53:45] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:53:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s18 1), p2:(GEQ s10 1), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1722 reset in 213 ms.
Product exploration explored 100000 steps with 1701 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Incomplete random walk after 10030 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 4) seen :3
Finished Best-First random walk after 1268 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=317 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p1), (F p2), (F (AND p0 p1)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 445 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:53:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:53:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 10:53:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:53:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:53:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 10:53:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 10:53:48] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 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
[2022-05-16 10:53:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:53:48] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:53:48] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:53:48] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Incomplete random walk after 10032 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 4) seen :3
Finished Best-First random walk after 391 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=391 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2), (F (AND p1 p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:53:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:53:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:53:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 10:53:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:53:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 10:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:53:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 10:53:49] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 10:53:49] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 1715 reset in 113 ms.
Product exploration explored 100000 steps with 1703 reset in 112 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2) p0), (AND p1 p0), p1]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 21 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2022-05-16 10:53:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2022-05-16 10:53:50] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:53:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/21 places, 17/18 transitions.
Product exploration explored 100000 steps with 1707 reset in 101 ms.
Product exploration explored 100000 steps with 1701 reset in 128 ms.
Built C files in :
/tmp/ltsmin16411484343925404631
[2022-05-16 10:53:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16411484343925404631
Running compilation step : cd /tmp/ltsmin16411484343925404631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin16411484343925404631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16411484343925404631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16672198147629051411.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 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.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:54:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:54:05] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:54:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:54:05] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:54:05] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-16 10:54:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5283443844576263629
[2022-05-16 10:54:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5283443844576263629
Running compilation step : cd /tmp/ltsmin5283443844576263629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin5283443844576263629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5283443844576263629;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13000973647741735648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:54:21] [INFO ] Flatten gal took : 4 ms
[2022-05-16 10:54:21] [INFO ] Flatten gal took : 3 ms
[2022-05-16 10:54:21] [INFO ] Time to serialize gal into /tmp/LTL14109128068208947719.gal : 1 ms
[2022-05-16 10:54:21] [INFO ] Time to serialize properties into /tmp/LTL5440204674370700535.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14109128068208947719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5440204674370700535.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1410912...267
Read 1 LTL properties
Checking formula 0 : !(((!((X((X("((SF>=1)&&(Mi>=1))"))&&("(SpA>=1)")))&&(G("(SpA>=1)"))))U(X("(MtF>=1)"))))
Formula 0 simplified : !(!(X("(SpA>=1)" & X"((SF>=1)&&(Mi>=1))") & G"(SpA>=1)") U X"(MtF>=1)")
Detected timeout of ITS tools.
[2022-05-16 10:54:36] [INFO ] Flatten gal took : 3 ms
[2022-05-16 10:54:36] [INFO ] Applying decomposition
[2022-05-16 10:54:36] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16610065683703086311.txt' '-o' '/tmp/graph16610065683703086311.bin' '-w' '/tmp/graph16610065683703086311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16610065683703086311.bin' '-l' '-1' '-v' '-w' '/tmp/graph16610065683703086311.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:54:36] [INFO ] Decomposing Gal with order
[2022-05-16 10:54:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:54:36] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 10:54:36] [INFO ] Flatten gal took : 28 ms
[2022-05-16 10:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 10:54:36] [INFO ] Time to serialize gal into /tmp/LTL3742756051043548411.gal : 1 ms
[2022-05-16 10:54:36] [INFO ] Time to serialize properties into /tmp/LTL865890136853680602.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3742756051043548411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL865890136853680602.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3742756...244
Read 1 LTL properties
Checking formula 0 : !(((!((X((X("((u1.SF>=1)&&(i2.u2.Mi>=1))"))&&("(u5.SpA>=1)")))&&(G("(u5.SpA>=1)"))))U(X("(i2.u0.MtF>=1)"))))
Formula 0 simplified : !(!(X("(u5.SpA>=1)" & X"((u1.SF>=1)&&(i2.u2.Mi>=1))") & G"(u5.SpA>=1)") U X"(i2.u0.MtF>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11571590300419210851
[2022-05-16 10:54:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11571590300419210851
Running compilation step : cd /tmp/ltsmin11571590300419210851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin11571590300419210851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11571590300419210851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X((X((LTLAPp0==true))&&(LTLAPp1==true)))&&[]((LTLAPp1==true))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-00 finished in 80439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||G(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 18 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Applied a total of 19 rules in 9 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 10:55:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:55:06] [INFO ] Implicit Places using invariants in 33 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 8
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-16 10:55:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:55:06] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-16 10:55:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:55:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 8/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s5 1), p0:(AND (GEQ s2 1) (GEQ s7 1)), p2:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-01 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))||p0) U F(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 4 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 10:55:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:55:06] [INFO ] Implicit Places using invariants in 30 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 places, 6/18 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 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 7 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 10:55:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:55:06] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 10:55:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:55:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/24 places, 4/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 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 15133 reset in 79 ms.
Product exploration explored 100000 steps with 15145 reset in 98 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 10:55:07] [INFO ] Computed 2 place invariants in 0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-02 finished in 740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((!(p1 U !X(!G(p1)))&&p0)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 7 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 10:55:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:55:07] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 10/18 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 1 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 8
Applied a total of 4 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 10:55:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:55:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 10:55:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:55:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/24 places, 8/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s3 1) (GEQ s10 1)), p1:(AND (GEQ s1 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32141 reset in 86 ms.
Stack based approach found an accepted trace after 5538 steps with 1769 reset with depth 8 and stack size 8 in 9 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-03 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:55:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:55:07] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GEQ s9 1), p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4467 reset in 173 ms.
Product exploration explored 100000 steps with 4504 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1023 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=341 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 10:55:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 10:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:55:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 10:55:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:55:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 10:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:55:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 10:55:08] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 10:55:08] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:55:08] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:55:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:08] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-16 10:55:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 654 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=218 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 10:55:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 10:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:55:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 10:55:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:55:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 10:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:55:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 10:55:09] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 10:55:09] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4506 reset in 101 ms.
Product exploration explored 100000 steps with 4512 reset in 87 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 17 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 17 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 12 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2022-05-16 10:55:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2022-05-16 10:55:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:55:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 14/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 19065 reset in 128 ms.
Product exploration explored 100000 steps with 19058 reset in 124 ms.
Built C files in :
/tmp/ltsmin10789274517221408965
[2022-05-16 10:55:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10789274517221408965
Running compilation step : cd /tmp/ltsmin10789274517221408965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin10789274517221408965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10789274517221408965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6090355102448564960.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:55:25] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:55:25] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 10:55:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:55:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin11289002089903157581
[2022-05-16 10:55:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11289002089903157581
Running compilation step : cd /tmp/ltsmin11289002089903157581;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin11289002089903157581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11289002089903157581;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14724386024114456267.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:55:40] [INFO ] Flatten gal took : 5 ms
[2022-05-16 10:55:40] [INFO ] Flatten gal took : 8 ms
[2022-05-16 10:55:40] [INFO ] Time to serialize gal into /tmp/LTL482790143756691166.gal : 2 ms
[2022-05-16 10:55:40] [INFO ] Time to serialize properties into /tmp/LTL7502102587828812709.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL482790143756691166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7502102587828812709.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4827901...265
Read 1 LTL properties
Checking formula 0 : !((X(F(("(SpG>=1)")||(G("(MpA>=1)"))))))
Formula 0 simplified : !XF("(SpG>=1)" | G"(MpA>=1)")
Detected timeout of ITS tools.
[2022-05-16 10:55:55] [INFO ] Flatten gal took : 2 ms
[2022-05-16 10:55:55] [INFO ] Applying decomposition
[2022-05-16 10:55:55] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph160031730791409614.txt' '-o' '/tmp/graph160031730791409614.bin' '-w' '/tmp/graph160031730791409614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph160031730791409614.bin' '-l' '-1' '-v' '-w' '/tmp/graph160031730791409614.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:55:55] [INFO ] Decomposing Gal with order
[2022-05-16 10:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:55:55] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 10:55:55] [INFO ] Flatten gal took : 3 ms
[2022-05-16 10:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 10:55:55] [INFO ] Time to serialize gal into /tmp/LTL17097453953398692945.gal : 0 ms
[2022-05-16 10:55:55] [INFO ] Time to serialize properties into /tmp/LTL10689427631836364220.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17097453953398692945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10689427631836364220.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1709745...247
Read 1 LTL properties
Checking formula 0 : !((X(F(("(u3.SpG>=1)")||(G("(u0.MpA>=1)"))))))
Formula 0 simplified : !XF("(u3.SpG>=1)" | G"(u0.MpA>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17494254073893622436
[2022-05-16 10:56:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17494254073893622436
Running compilation step : cd /tmp/ltsmin17494254073893622436;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin17494254073893622436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin17494254073893622436;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-04 finished in 78070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(((!p0 U p1)||p0))||p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:25] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:25] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:25] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s17 1), p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10376 reset in 90 ms.
Product exploration explored 100000 steps with 10391 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 367 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=73 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 10:56:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:56:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 10:56:27] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 10:56:27] [INFO ] Added : 9 causal constraints over 2 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0) (NOT p1))
Support contains 4 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
[2022-05-16 10:56:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:27] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 367 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=367 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 456 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 10:56:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 10:56:28] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 10:56:28] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10236 reset in 82 ms.
Product exploration explored 100000 steps with 10383 reset in 81 ms.
Built C files in :
/tmp/ltsmin5409454284565195544
[2022-05-16 10:56:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5409454284565195544
Running compilation step : cd /tmp/ltsmin5409454284565195544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin5409454284565195544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5409454284565195544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3917889336708616361.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-05 finished in 3595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(G(p1))&&p0)))||G(p2)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 10:56:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 10:56:29] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s9 1), p0:(AND (GEQ s7 1) (GEQ s19 1)), p1:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14284 steps with 0 reset in 18 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-06 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 0 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:29] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s6 1), p1:(OR (LT s2 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33312 reset in 66 ms.
Product exploration explored 100000 steps with 33470 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 899 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=224 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 291 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
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.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:30] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:30] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 10:56:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 831 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=415 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33288 reset in 70 ms.
Product exploration explored 100000 steps with 33403 reset in 73 ms.
Built C files in :
/tmp/ltsmin12682486385792017959
[2022-05-16 10:56:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12682486385792017959
Running compilation step : cd /tmp/ltsmin12682486385792017959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin12682486385792017959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12682486385792017959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12395855894699639952.hoa' '--buchi-type=spotba'
LTSmin run took 2298 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-07 finished in 5137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))||G(p2)||X(p2)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 10:56:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:56:34] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s10 1), p1:(AND (GEQ s7 1) (GEQ s19 1)), p2:(AND (GEQ s8 1) (GEQ s14 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-09 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(G(X(X(p0)))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:35] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-10 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(G(X(p0))))||p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 6 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 10:56:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:35] [INFO ] Implicit Places using invariants in 34 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7461 reset in 93 ms.
Product exploration explored 100000 steps with 7478 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 42 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:56:35] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:56:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-16 10:56:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:56:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 42 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7470 reset in 75 ms.
Product exploration explored 100000 steps with 7425 reset in 99 ms.
Built C files in :
/tmp/ltsmin15341047927783695904
[2022-05-16 10:56:36] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 10:56:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:36] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 10:56:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:36] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 10:56:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15341047927783695904
Running compilation step : cd /tmp/ltsmin15341047927783695904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin15341047927783695904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15341047927783695904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17392453978186959843.hoa' '--buchi-type=spotba'
LTSmin run took 1041 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-11 finished in 2689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:37] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-13 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 10:56:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:56:38] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s16 1)), p0:(GEQ s9 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 5710 reset in 74 ms.
Product exploration explored 100000 steps with 5662 reset in 75 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 326 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=326 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 10:56:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 10:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 10:56:38] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 10:56:38] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
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 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 15 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 15 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 10 transition count 7
Applied a total of 22 rules in 5 ms. Remains 10 /21 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 10:56:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 10:56:38] [INFO ] Implicit Places using invariants in 19 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/21 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/21 places, 7/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 10:56:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 10:56:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 10:56:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:56:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 10:56:39] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 10:56:39] [INFO ] Added : 4 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15152 reset in 63 ms.
Product exploration explored 100000 steps with 15197 reset in 62 ms.
Built C files in :
/tmp/ltsmin2880060116278903824
[2022-05-16 10:56:39] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-16 10:56:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:39] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-16 10:56:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:39] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-16 10:56:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2880060116278903824
Running compilation step : cd /tmp/ltsmin2880060116278903824;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin2880060116278903824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2880060116278903824;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5847862449041392475.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-15 finished in 1497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X((X(p0)&&p1))&&G(p1)) U X(p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a CL insensitive property : ClientsAndServers-PT-N0020P0-LTLFireability-04
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
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 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 7 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 10:56:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 10:56:39] [INFO ] Implicit Places using invariants in 26 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 10/24 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 6
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:56:39] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:56:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 7/24 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GEQ s2 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 24983 reset in 58 ms.
Product exploration explored 100000 steps with 24957 reset in 59 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 453 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=226 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:56:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 10:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 10:56:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:56:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:40] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 10:56:40] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 10:56:40] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:56:40] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:56:40] [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.
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:56:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 165 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=165 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:56:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 10:56:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:56:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:56:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 10:56:41] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 10:56:41] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25032 reset in 55 ms.
Product exploration explored 100000 steps with 24870 reset in 71 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-16 10:56:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 10:56:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:56:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Product exploration explored 100000 steps with 25061 reset in 75 ms.
Product exploration explored 100000 steps with 24983 reset in 78 ms.
Built C files in :
/tmp/ltsmin9296770713557151728
[2022-05-16 10:56:41] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9296770713557151728
Running compilation step : cd /tmp/ltsmin9296770713557151728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin9296770713557151728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9296770713557151728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased197327403933465108.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
Treatment of property ClientsAndServers-PT-N0020P0-LTLFireability-04 finished in 2369 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLFireability-04 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 10:56:42] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1658231764842079311
[2022-05-16 10:56:42] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 10:56:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:42] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 10:56:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:42] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 10:56:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:56:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1658231764842079311
Running compilation step : cd /tmp/ltsmin1658231764842079311;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 10:56:42] [INFO ] Applying decomposition
[2022-05-16 10:56:42] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10372048535869420792.txt' '-o' '/tmp/graph10372048535869420792.bin' '-w' '/tmp/graph10372048535869420792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10372048535869420792.bin' '-l' '-1' '-v' '-w' '/tmp/graph10372048535869420792.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:56:42] [INFO ] Decomposing Gal with order
[2022-05-16 10:56:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:56:42] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 10:56:42] [INFO ] Flatten gal took : 2 ms
[2022-05-16 10:56:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 10:56:42] [INFO ] Time to serialize gal into /tmp/LTLFireability7203930886752034844.gal : 1 ms
[2022-05-16 10:56:42] [INFO ] Time to serialize properties into /tmp/LTLFireability5679947762507818579.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7203930886752034844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5679947762507818579.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !(((!((X((X("((i0.u3.SF>=1)&&(i1.u5.Mi>=1))"))&&("(i0.u8.SpA>=1)")))&&(G("(i0.u8.SpA>=1)"))))U(X("(i1.u5.MtF>=1)"))))
Formula 0 simplified : !(!(X("(i0.u8.SpA>=1)" & X"((i0.u3.SF>=1)&&(i1.u5.Mi>=1))") & G"(i0.u8.SpA>=1)") U X"(i1.u5.MtF>=1)")
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin1658231764842079311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1658231764842079311;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X((X((LTLAPp0==true))&&(LTLAPp1==true)))&&[]((LTLAPp1==true))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: (!(X((X((LTLAPp0==true))&&(LTLAPp1==true)))&&[]((LTLAPp1==true))) U X((LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: "(!(X((X((LTLAPp0==true))&&(LTLAPp1==true)))&&[]((LTLAPp1==true))) U X((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.068: DFS-FIFO for weak LTL, using special progress label 24
pins2lts-mc-linux64( 0/ 8), 0.068: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.068: State length is 25, there are 32 groups
pins2lts-mc-linux64( 0/ 8), 0.068: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.068: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.068: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.068: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.124: ~113 levels ~960 states ~6368 transitions
pins2lts-mc-linux64( 0/ 8), 0.210: ~217 levels ~1920 states ~12720 transitions
pins2lts-mc-linux64( 0/ 8), 0.347: ~437 levels ~3840 states ~28576 transitions
pins2lts-mc-linux64( 0/ 8), 0.449: ~719 levels ~7680 states ~42144 transitions
pins2lts-mc-linux64( 0/ 8), 0.494: ~755 levels ~15360 states ~56016 transitions
pins2lts-mc-linux64( 7/ 8), 0.683: ~963 levels ~30720 states ~99888 transitions
pins2lts-mc-linux64( 7/ 8), 0.871: ~963 levels ~61440 states ~172016 transitions
pins2lts-mc-linux64( 7/ 8), 1.094: ~963 levels ~122880 states ~327208 transitions
pins2lts-mc-linux64( 1/ 8), 1.481: ~948 levels ~245760 states ~548232 transitions
pins2lts-mc-linux64( 1/ 8), 2.072: ~948 levels ~491520 states ~1103952 transitions
pins2lts-mc-linux64( 1/ 8), 2.807: ~948 levels ~983040 states ~2372176 transitions
pins2lts-mc-linux64( 6/ 8), 3.779: ~952 levels ~1966080 states ~4727984 transitions
pins2lts-mc-linux64( 6/ 8), 5.580: ~952 levels ~3932160 states ~9407728 transitions
pins2lts-mc-linux64( 6/ 8), 9.086: ~952 levels ~7864320 states ~18876336 transitions
pins2lts-mc-linux64( 6/ 8), 16.510: ~952 levels ~15728640 states ~38771016 transitions
pins2lts-mc-linux64( 6/ 8), 33.895: ~952 levels ~31457280 states ~83653080 transitions
pins2lts-mc-linux64( 6/ 8), 69.078: ~952 levels ~62914560 states ~174709384 transitions
pins2lts-mc-linux64( 6/ 8), 147.382: ~952 levels ~125829120 states ~374539008 transitions
pins2lts-mc-linux64( 2/ 8), 179.818: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 179.854:
pins2lts-mc-linux64( 0/ 8), 179.854: mean standard work distribution: 3.4% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 179.854:
pins2lts-mc-linux64( 0/ 8), 179.854: Explored 134372733 states 428444950 transitions, fanout: 3.188
pins2lts-mc-linux64( 0/ 8), 179.854: Total exploration time 179.760 sec (179.740 sec minimum, 179.750 sec on average)
pins2lts-mc-linux64( 0/ 8), 179.854: States per second: 747512, Transitions per second: 2383428
pins2lts-mc-linux64( 0/ 8), 179.854:
pins2lts-mc-linux64( 0/ 8), 179.854: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 179.854: Redundant explorations: 0.1158
pins2lts-mc-linux64( 0/ 8), 179.854:
pins2lts-mc-linux64( 0/ 8), 179.854: Queue width: 8B, total height: 7680, memory: 0.06MB
pins2lts-mc-linux64( 0/ 8), 179.854: Tree memory: 1226.3MB, 9.6 B/state, compr.: 9.4%
pins2lts-mc-linux64( 0/ 8), 179.854: Tree fill ratio (roots/leafs): 99.0%/79.0%
pins2lts-mc-linux64( 0/ 8), 179.854: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 179.854: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 179.854: Est. total memory use: 1226.3MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1658231764842079311;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X((X((LTLAPp0==true))&&(LTLAPp1==true)))&&[]((LTLAPp1==true))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1658231764842079311;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X((X((LTLAPp0==true))&&(LTLAPp1==true)))&&[]((LTLAPp1==true))) U X((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 11:17:41] [INFO ] Flatten gal took : 6 ms
[2022-05-16 11:17:41] [INFO ] Time to serialize gal into /tmp/LTLFireability7262948820842491873.gal : 1 ms
[2022-05-16 11:17:41] [INFO ] Time to serialize properties into /tmp/LTLFireability2643421072568590038.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7262948820842491873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2643421072568590038.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !(((!((X((X("((SF>=1)&&(Mi>=1))"))&&("(SpA>=1)")))&&(G("(SpA>=1)"))))U(X("(MtF>=1)"))))
Formula 0 simplified : !(!(X("(SpA>=1)" & X"((SF>=1)&&(Mi>=1))") & G"(SpA>=1)") U X"(MtF>=1)")
Detected timeout of ITS tools.
[2022-05-16 11:38:40] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:38:40] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 11:38:40] [INFO ] Transformed 24 places.
[2022-05-16 11:38:40] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-16 11:38:40] [INFO ] Time to serialize gal into /tmp/LTLFireability4923576836396646292.gal : 0 ms
[2022-05-16 11:38:40] [INFO ] Time to serialize properties into /tmp/LTLFireability11341195938171508303.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4923576836396646292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11341195938171508303.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((!((X((X("((SF>=1)&&(Mi>=1))"))&&("(SpA>=1)")))&&(G("(SpA>=1)"))))U(X("(MtF>=1)"))))
Formula 0 simplified : !(!(X("(SpA>=1)" & X"((SF>=1)&&(Mi>=1))") & G"(SpA>=1)") U X"(MtF>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ClientsAndServers-PT-N0020P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0020P0, 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 r024-tall-165251919100836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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