Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1006K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748645068505

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 22:44:30] [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]
[2025-05-30 22:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:44:31] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2025-05-30 22:44:31] [INFO ] Transformed 499 places.
[2025-05-30 22:44:31] [INFO ] Transformed 2191 transitions.
[2025-05-30 22:44:31] [INFO ] Parsed PT model containing 499 places and 2191 transitions and 6573 arcs in 663 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 509 transitions
Reduce redundant transitions removed 509 transitions.
FORMULA Eratosthenes-PT-500-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1682/1682 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 334 transition count 1612
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 334 transition count 1612
Drop transitions (Redundant composition of simpler transitions.) removed 1278 transitions
Redundant transition composition rules discarded 1278 transitions
Iterating global reduction 0 with 1278 rules applied. Total rules applied 1418 place count 334 transition count 334
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 1705 place count 47 transition count 47
Iterating global reduction 0 with 287 rules applied. Total rules applied 1992 place count 47 transition count 47
Applied a total of 1992 rules in 151 ms. Remains 47 /404 variables (removed 357) and now considering 47/1682 (removed 1635) transitions.
// Phase 1: matrix 47 rows 47 cols
[2025-05-30 22:44:32] [INFO ] Computed 0 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:32] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 22:44:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:32] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 47/404 places, 47/1682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 47/404 places, 47/1682 transitions.
Support contains 46 out of 47 places after structural reductions.
[2025-05-30 22:44:32] [INFO ] Flatten gal took : 22 ms
[2025-05-30 22:44:32] [INFO ] Flatten gal took : 8 ms
[2025-05-30 22:44:32] [INFO ] Input system was already deterministic with 47 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 1614 steps (0 resets) in 75 ms. (21 steps per ms) remains 0/32 properties
FORMULA Eratosthenes-PT-500-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p1)||(!p2 U (p3||G(!p2))))&&p0))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 4 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 43 output transitions
Drop transitions (Output transitions of discarded places.) removed 43 transitions
Applied a total of 1 rules in 6 ms. Remains 4 /47 variables (removed 43) and now considering 4/47 (removed 43) transitions.
// Phase 1: matrix 4 rows 4 cols
[2025-05-30 22:44:33] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 22:44:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:33] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/47 places, 4/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 4/47 places, 4/47 transitions.
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-00
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-00 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1||X(!p1)||(p2 U X(p2))))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 5 transition count 5
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 5 transition count 5
Applied a total of 84 rules in 2 ms. Remains 5 /47 variables (removed 42) and now considering 5/47 (removed 42) transitions.
// Phase 1: matrix 5 rows 5 cols
[2025-05-30 22:44:34] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-30 22:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 5/47 places, 5/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 5/47 places, 5/47 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), false, (AND p1 (NOT p2)), (AND (NOT p2) p1), true, (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-02
Product exploration explored 100000 steps with 28946 reset in 248 ms.
Product exploration explored 100000 steps with 28972 reset in 243 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 694 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p2) p1), false, false, true]
RANDOM walk for 3246 steps (6 resets) in 8 ms. (360 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 1029 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (AND (NOT p2) p1), false, false, true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (AND (NOT p2) p1), false, false, true]
Support contains 3 out of 5 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2025-05-30 22:44:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 22:44:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 5/5 places, 5/5 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p1), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 322 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), false, (AND (NOT p2) p1), true, false]
RANDOM walk for 2032 steps (4 resets) in 40 ms. (49 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p1), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 441 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), false, (AND (NOT p2) p1), true, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), false, (AND (NOT p2) p1), true, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), false, (AND (NOT p2) p1), true, false]
Product exploration explored 100000 steps with 41658 reset in 286 ms.
Product exploration explored 100000 steps with 41622 reset in 96 ms.
Applying partial POR strategy [true, false, false, true, false]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), false, (AND (NOT p2) p1), true, false]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Graph (complete) has 0 edges and 5 vertex of which 3 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:39] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/5 places, 3/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8 ms. Remains : 3/5 places, 3/5 transitions.
Built C files in :
/tmp/ltsmin8221028527060279196
[2025-05-30 22:44:39] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8221028527060279196
Running compilation step : cd /tmp/ltsmin8221028527060279196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 296 ms.
Running link step : cd /tmp/ltsmin8221028527060279196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin8221028527060279196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11671050262760866180.hoa' '--buchi-type=spotba'
LTSmin run took 237 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Eratosthenes-PT-500-LTLFireability-02 finished in 6344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1)))&&F(p2))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 7 transition count 7
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 7 transition count 7
Applied a total of 80 rules in 2 ms. Remains 7 /47 variables (removed 40) and now considering 7/47 (removed 40) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-05-30 22:44:40] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 22:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 7/47 places, 7/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 7/47 places, 7/47 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-03
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-03 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 3 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /47 variables (removed 44) and now considering 3/47 (removed 44) transitions.
// Phase 1: matrix 3 rows 3 cols
[2025-05-30 22:44:40] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 22:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:40] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/47 places, 3/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 3/47 places, 3/47 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-05 finished in 191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 2 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions (Output transitions of discarded places.) removed 45 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /47 variables (removed 45) and now considering 2/47 (removed 45) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-05-30 22:44:40] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-30 22:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:41] [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.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:41] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/47 places, 2/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 2/47 places, 2/47 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-06 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((F(p1)&&F(p2))||p0))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 6 transition count 6
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 6 transition count 6
Applied a total of 82 rules in 0 ms. Remains 6 /47 variables (removed 41) and now considering 6/47 (removed 41) transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-05-30 22:44:41] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 22:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 6/47 places, 6/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 6/47 places, 6/47 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-07
Product exploration explored 100000 steps with 33150 reset in 95 ms.
Product exploration explored 100000 steps with 33018 reset in 100 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 26 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-07 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||G((p1&&(!p2||X(G(p3)))))))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 6 transition count 6
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 6 transition count 6
Applied a total of 82 rules in 1 ms. Remains 6 /47 variables (removed 41) and now considering 6/47 (removed 41) transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-05-30 22:44:41] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 22:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 6/47 places, 6/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 6/47 places, 6/47 transitions.
Stuttering acceptance computed with spot in 419 ms :[true, (NOT p0), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p3) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-08
Entered a terminal (fully accepting) state of product in 817 steps with 3 reset in 2 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-08 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1 U p2))))))'
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 7 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 7 /47 variables (removed 40) and now considering 7/47 (removed 40) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-05-30 22:44:42] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-30 22:44:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:42] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/47 places, 7/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 7/47 places, 7/47 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-09 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U (X(X(X(p1)))&&(G(!p2)||(!p2&&F(!p0))))))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 7 transition count 7
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 7 transition count 7
Applied a total of 80 rules in 0 ms. Remains 7 /47 variables (removed 40) and now considering 7/47 (removed 40) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-05-30 22:44:42] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 22:44:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 7/47 places, 7/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 7/47 places, 7/47 transitions.
Stuttering acceptance computed with spot in 1736 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), (AND p0 p2), (OR (NOT p1) p2), (NOT p1), (NOT p1), (AND p2 p0 (NOT p1)), (NOT p1), (NOT p1), (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p1), (NOT p1), (AND p2 p0 (NOT p1)), (NOT p1), (NOT p1), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-10
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-10 finished in 1853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||(G(!p1) U G(p2))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 6 transition count 6
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 6 transition count 6
Applied a total of 82 rules in 2 ms. Remains 6 /47 variables (removed 41) and now considering 6/47 (removed 41) transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-05-30 22:44:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 22:44:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 6/47 places, 6/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 6/47 places, 6/47 transitions.
Stuttering acceptance computed with spot in 652 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p2) (NOT p1)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-11
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-11 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G((F(p1) U !p0))))))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3 transition count 3
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3 transition count 3
Applied a total of 88 rules in 1 ms. Remains 3 /47 variables (removed 44) and now considering 3/47 (removed 44) transitions.
// Phase 1: matrix 3 rows 3 cols
[2025-05-30 22:44:45] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 22:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 3/47 places, 3/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 3/47 places, 3/47 transitions.
Stuttering acceptance computed with spot in 336 ms :[false, false, false, p0, (NOT p1), p0]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-12
Product exploration explored 100000 steps with 246 reset in 151 ms.
Product exploration explored 100000 steps with 246 reset in 194 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[false, false, false, p0, (NOT p1), p0]
RANDOM walk for 2843 steps (6 resets) in 6 ms. (406 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 273 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2025-05-30 22:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 22:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[false, false, false, p0, (NOT p1), p0]
RANDOM walk for 2844 steps (6 resets) in 7 ms. (355 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 303 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 284 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 281 ms :[false, false, false, p0, (NOT p1), p0]
Product exploration explored 100000 steps with 246 reset in 58 ms.
Product exploration explored 100000 steps with 246 reset in 67 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 265 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 0 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:49] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8 ms. Remains : 2/3 places, 2/3 transitions.
Built C files in :
/tmp/ltsmin18188067813257482716
[2025-05-30 22:44:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18188067813257482716
Running compilation step : cd /tmp/ltsmin18188067813257482716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin18188067813257482716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin18188067813257482716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18319953728397538829.hoa' '--buchi-type=spotba'
LTSmin run took 267 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Eratosthenes-PT-500-LTLFireability-12 finished in 4792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3 transition count 3
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3 transition count 3
Applied a total of 88 rules in 1 ms. Remains 3 /47 variables (removed 44) and now considering 3/47 (removed 44) transitions.
// Phase 1: matrix 3 rows 3 cols
[2025-05-30 22:44:49] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 22:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 3/47 places, 3/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 3/47 places, 3/47 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-13
Stuttering criterion allowed to conclude after 416 steps with 6 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-13 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 4 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 43 output transitions
Drop transitions (Output transitions of discarded places.) removed 43 transitions
Applied a total of 1 rules in 2 ms. Remains 4 /47 variables (removed 43) and now considering 4/47 (removed 43) transitions.
// Phase 1: matrix 4 rows 4 cols
[2025-05-30 22:44:50] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 22:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 22:44:50] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 22:44:50] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/47 places, 4/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 4/47 places, 4/47 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-14
Product exploration explored 100000 steps with 27036 reset in 57 ms.
Product exploration explored 100000 steps with 26960 reset in 212 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-14 finished in 483 ms.
All properties solved by simple procedures.
Total runtime 19785 ms.

BK_STOP 1748645091118

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Eratosthenes-PT-500"
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-5832"
echo " Executing tool itstools"
echo " Input is Eratosthenes-PT-500, 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 r086-smll-174860101800044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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