fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912644900068
Last Updated
May 14, 2023

About the Execution of ITS-Tools for SmallOperatingSystem-PT-MT0256DC0128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
337.107 31674.00 46514.00 631.40 FFFFFTFTFTFTFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 25 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 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 SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679182621084

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0256DC0128
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 23:37:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:37:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:37:04] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-18 23:37:04] [INFO ] Transformed 9 places.
[2023-03-18 23:37:04] [INFO ] Transformed 8 transitions.
[2023-03-18 23:37:04] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 18 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 23:37:04] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-18 23:37:05] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-18 23:37:05] [INFO ] Invariant cache hit.
[2023-03-18 23:37:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-18 23:37:05] [INFO ] Invariant cache hit.
[2023-03-18 23:37:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-18 23:37:05] [INFO ] Flatten gal took : 27 ms
[2023-03-18 23:37:05] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:37:05] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 1808 steps, including 0 resets, run visited all 10 properties in 24 ms. (steps per millisecond=75 )
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F((p1&&F(p2)))))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 11 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 23:37:06] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 23:37:06] [INFO ] Invariant cache hit.
[2023-03-18 23:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 23:37:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 23:37:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:37:06] [INFO ] Invariant cache hit.
[2023-03-18 23:37:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 476 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p2:(GEQ s6 1), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8005 steps with 0 reset in 212 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-01 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 8 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-18 23:37:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 23:37:07] [INFO ] Implicit Places using invariants in 50 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 5/8 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 2 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-18 23:37:07] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 23:37:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 23:37:07] [INFO ] Invariant cache hit.
[2023-03-18 23:37:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-02 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 5 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-18 23:37:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:37:07] [INFO ] Implicit Places using invariants in 42 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 6
Applied a total of 2 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-18 23:37:07] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 23:37:07] [INFO ] Invariant cache hit.
[2023-03-18 23:37:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/9 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 6/9 places, 6/8 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11395 reset in 359 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-03 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!X(p0))) U X((G(p0) U p0)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 23:37:08] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-18 23:37:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 23:37:08] [INFO ] Invariant cache hit.
[2023-03-18 23:37:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-18 23:37:08] [INFO ] Invariant cache hit.
[2023-03-18 23:37:08] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 267 ms :[p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6435 reset in 177 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-04 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||F(p1))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 23:37:08] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:08] [INFO ] Implicit Places using invariants in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25019 reset in 186 ms.
Product exploration explored 100000 steps with 24999 reset in 315 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) p0), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
// Phase 1: matrix 8 rows 7 cols
[2023-03-18 23:37:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 23:37:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:37:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 23:37:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:37:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:37:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 23:37:10] [INFO ] Computed and/alt/rep : 7/10/7 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 23:37:10] [INFO ] Added : 6 causal constraints over 2 iterations in 46 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-18 23:37:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 23:37:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 23:37:10] [INFO ] Invariant cache hit.
[2023-03-18 23:37:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 23:37:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 23:37:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:37:10] [INFO ] Invariant cache hit.
[2023-03-18 23:37:10] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 6/7 places, 7/8 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 : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
[2023-03-18 23:37:10] [INFO ] Invariant cache hit.
[2023-03-18 23:37:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:37:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-18 23:37:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:37:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:37:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 23:37:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 23:37:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-18 23:37:10] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 23:37:10] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Product exploration explored 100000 steps with 24955 reset in 138 ms.
Product exploration explored 100000 steps with 24964 reset in 149 ms.
Built C files in :
/tmp/ltsmin14933477703030116764
[2023-03-18 23:37:11] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2023-03-18 23:37:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:37:11] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2023-03-18 23:37:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:37:11] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2023-03-18 23:37:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:37:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14933477703030116764
Running compilation step : cd /tmp/ltsmin14933477703030116764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 400 ms.
Running link step : cd /tmp/ltsmin14933477703030116764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin14933477703030116764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3639829995807105393.hoa' '--buchi-type=spotba'
LTSmin run took 188 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-05 finished in 3414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-18 23:37:12] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants in 27 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 5/8 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 2 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-18 23:37:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 23:37:12] [INFO ] Invariant cache hit.
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-06 finished in 142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(!p1)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 23:37:12] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 23:37:12] [INFO ] Invariant cache hit.
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 23:37:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:37:12] [INFO ] Invariant cache hit.
[2023-03-18 23:37:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-08 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(!p1)))||X((p2 U p3))))'
Support contains 7 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 23:37:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 23:37:12] [INFO ] Invariant cache hit.
[2023-03-18 23:37:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-18 23:37:12] [INFO ] Invariant cache hit.
[2023-03-18 23:37:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 393 ms :[true, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p0 p1 (NOT p3)), p1, (AND p1 p0), (NOT p3)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p3:(AND (GEQ s4 1) (GEQ s6 1)), p2:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25100 reset in 184 ms.
Product exploration explored 100000 steps with 24986 reset in 222 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 p3) (NOT p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) p2)), (X (AND (NOT p0) (NOT p3) p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2))))]
Knowledge based reduction with 27 factoid took 2068 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Incomplete random walk after 10058 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=295 ) properties (out of 16) seen :14
Finished Best-First random walk after 536 steps, including 0 resets, run visited all 2 properties in 20 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) p2)), (X (AND (NOT p0) (NOT p3) p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (AND (NOT p2) (NOT p3) p1)), (F (AND p2 (NOT p3) (NOT p1) p0)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (AND p2 (NOT p3))), (F (AND p2 (NOT p3) p1 p0)), (F (AND (NOT p2) (NOT p3) p1 p0))]
Knowledge based reduction with 27 factoid took 2415 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Stuttering acceptance computed with spot in 691 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Support contains 7 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 23:37:19] [INFO ] Invariant cache hit.
[2023-03-18 23:37:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 23:37:19] [INFO ] Invariant cache hit.
[2023-03-18 23:37:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-18 23:37:19] [INFO ] Invariant cache hit.
[2023-03-18 23:37:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 9/9 places, 8/8 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 p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p1 p0))), (X (NOT (AND p2 (NOT p3) p1 p0))), (X (AND p2 (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1)))))]
Knowledge based reduction with 21 factoid took 1508 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Incomplete random walk after 10056 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=529 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:37:21] [INFO ] Invariant cache hit.
[2023-03-18 23:37:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 23:37:21] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:37:21] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:37:21] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:37:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 23:37:21] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:37:21] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 23:37:21] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p1 p0))), (X (NOT (AND p2 (NOT p3) p1 p0))), (X (AND p2 (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (AND (NOT p2) (NOT p3) p1)), (F (AND p2 (NOT p3) (NOT p1) p0)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (AND p2 (NOT p3))), (F (AND p2 (NOT p3) p1 p0)), (F (AND (NOT p2) (NOT p3) p1 p0))]
Knowledge based reduction with 21 factoid took 1793 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Product exploration explored 100000 steps with 25075 reset in 206 ms.
Product exploration explored 100000 steps with 25019 reset in 260 ms.
Applying partial POR strategy [true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p3), (AND p0 p1 (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 p0), (AND p0 p1 (NOT p3))]
Support contains 7 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 23:37:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:37:25] [INFO ] Invariant cache hit.
[2023-03-18 23:37:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 9/9 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin17713551059920780107
[2023-03-18 23:37:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17713551059920780107
Running compilation step : cd /tmp/ltsmin17713551059920780107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin17713551059920780107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17713551059920780107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6182039959021404586.hoa' '--buchi-type=spotba'
LTSmin run took 189 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-09 finished in 13726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 4 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-18 23:37:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 23:37:26] [INFO ] Implicit Places using invariants in 35 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 5/8 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 3 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-18 23:37:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 23:37:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 23:37:26] [INFO ] Invariant cache hit.
[2023-03-18 23:37:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9 places, 3/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 2/9 places, 3/8 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-10 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G((p0 U p1)) U p0))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 23:37:26] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:26] [INFO ] Implicit Places using invariants in 39 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), p1]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s5 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 24936 reset in 116 ms.
Product exploration explored 100000 steps with 24992 reset in 137 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 563 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), p1]
Finished random walk after 1548 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=387 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 566 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), p1]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), p1]
// Phase 1: matrix 7 rows 6 cols
[2023-03-18 23:37:28] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-18 23:37:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:37:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 23:37:28] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 23:37:28] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-18 23:37:28] [INFO ] Invariant cache hit.
[2023-03-18 23:37:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 23:37:28] [INFO ] Invariant cache hit.
[2023-03-18 23:37:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-18 23:37:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:37:28] [INFO ] Invariant cache hit.
[2023-03-18 23:37:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 6/6 places, 7/7 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 559 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), p1]
Finished random walk after 774 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=154 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 626 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), p1]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), p1]
[2023-03-18 23:37:30] [INFO ] Invariant cache hit.
[2023-03-18 23:37:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:37:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-18 23:37:30] [INFO ] Computed and/alt/rep : 6/8/6 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 23:37:30] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), p1]
Product exploration explored 100000 steps with 25014 reset in 101 ms.
Product exploration explored 100000 steps with 25020 reset in 112 ms.
Built C files in :
/tmp/ltsmin17066074563129901201
[2023-03-18 23:37:30] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2023-03-18 23:37:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:37:30] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2023-03-18 23:37:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:37:30] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2023-03-18 23:37:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:37:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17066074563129901201
Running compilation step : cd /tmp/ltsmin17066074563129901201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin17066074563129901201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17066074563129901201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13483728474451065391.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-11 finished in 4384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 23:37:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:37:31] [INFO ] Implicit Places using invariants in 37 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 8
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-18 23:37:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 23:37:31] [INFO ] Invariant cache hit.
[2023-03-18 23:37:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/9 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s3 1) (GEQ s0 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-14 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 23:37:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:37:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 23:37:31] [INFO ] Invariant cache hit.
[2023-03-18 23:37:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-18 23:37:31] [INFO ] Invariant cache hit.
[2023-03-18 23:37:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, p0, p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s4 1) (GEQ s5 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0256DC0128-LTLFireability-15 finished in 256 ms.
All properties solved by simple procedures.
Total runtime 27191 ms.

BK_STOP 1679182652758

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT0256DC0128"
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-5348"
echo " Executing tool itstools"
echo " Input is SmallOperatingSystem-PT-MT0256DC0128, 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 r453-smll-167912644900068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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