About the Execution of ITS-Tools for Referendum-PT-1000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1705.964 | 328670.00 | 434728.00 | 914.70 | TFFFFFTFFFFTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r312-tall-171662339000636.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Referendum-PT-1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339000636
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 1.4M Apr 11 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Apr 11 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 430K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 429K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7M Apr 11 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 11 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.0M Apr 11 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 83K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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 Referendum-PT-1000-LTLFireability-00
FORMULA_NAME Referendum-PT-1000-LTLFireability-01
FORMULA_NAME Referendum-PT-1000-LTLFireability-02
FORMULA_NAME Referendum-PT-1000-LTLFireability-03
FORMULA_NAME Referendum-PT-1000-LTLFireability-04
FORMULA_NAME Referendum-PT-1000-LTLFireability-05
FORMULA_NAME Referendum-PT-1000-LTLFireability-06
FORMULA_NAME Referendum-PT-1000-LTLFireability-07
FORMULA_NAME Referendum-PT-1000-LTLFireability-08
FORMULA_NAME Referendum-PT-1000-LTLFireability-09
FORMULA_NAME Referendum-PT-1000-LTLFireability-10
FORMULA_NAME Referendum-PT-1000-LTLFireability-11
FORMULA_NAME Referendum-PT-1000-LTLFireability-12
FORMULA_NAME Referendum-PT-1000-LTLFireability-13
FORMULA_NAME Referendum-PT-1000-LTLFireability-14
FORMULA_NAME Referendum-PT-1000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716703886358
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 06:11:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 06:11:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 06:11:27] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-26 06:11:27] [INFO ] Transformed 3001 places.
[2024-05-26 06:11:27] [INFO ] Transformed 2001 transitions.
[2024-05-26 06:11:27] [INFO ] Found NUPN structural information;
[2024-05-26 06:11:27] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 183 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Referendum-PT-1000-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 3000 place count 1001 transition count 1001
Applied a total of 3000 rules in 81 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-26 06:11:28] [INFO ] Computed 0 invariants in 26 ms
[2024-05-26 06:11:28] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-26 06:11:28] [INFO ] Invariant cache hit.
[2024-05-26 06:11:29] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 1000 sub problems to find dead transitions.
[2024-05-26 06:11:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30041 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30027 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60937ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60965ms
Starting structural reductions in LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61917 ms. Remains : 1001/3001 places, 1001/2001 transitions.
Support contains 1001 out of 1001 places after structural reductions.
[2024-05-26 06:12:31] [INFO ] Flatten gal took : 363 ms
[2024-05-26 06:12:31] [INFO ] Flatten gal took : 132 ms
[2024-05-26 06:12:31] [INFO ] Input system was already deterministic with 1001 transitions.
Reduction of identical properties reduced properties to check from 12 to 10
RANDOM walk for 40000 steps (36 resets) in 3689 ms. (10 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4560 ms. (8 steps per ms) remains 1/1 properties
[2024-05-26 06:12:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 1001/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 2002/2002 variables, and 2002 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1022 ms.
Refiners :[Domain max(s): 1001/1001 constraints, State Equation: 1001/1001 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
After SMT solving in domain Int declared 1001/2002 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 127 ms.
Refiners :[Domain max(s): 0/1001 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2038ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 999 places :
Symmetric choice reduction at 0 with 999 rule applications. Total rules 999 place count 2 transition count 2
Iterating global reduction 0 with 999 rules applied. Total rules applied 1998 place count 2 transition count 2
Applied a total of 1998 rules in 37 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 06:12:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 06:12:36] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-26 06:12:36] [INFO ] Invariant cache hit.
[2024-05-26 06:12:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-05-26 06:12:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 52ms
Starting structural reductions in LTL mode, iteration 1 : 2/1001 places, 2/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 2/1001 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-00 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 1001 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-26 06:12:36] [INFO ] Computed 0 invariants in 4 ms
[2024-05-26 06:12:36] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-26 06:12:36] [INFO ] Invariant cache hit.
[2024-05-26 06:12:37] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2024-05-26 06:12:37] [INFO ] Redundant transitions in 56 ms returned []
Running 1000 sub problems to find dead transitions.
[2024-05-26 06:12:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30017 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30036 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60674ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61395 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-01
Stuttering criterion allowed to conclude after 1003 steps with 1 reset in 51 ms.
FORMULA Referendum-PT-1000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-01 finished in 61591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 13 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-26 06:13:38] [INFO ] Invariant cache hit.
[2024-05-26 06:13:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-26 06:13:38] [INFO ] Invariant cache hit.
[2024-05-26 06:13:38] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-26 06:13:38] [INFO ] Redundant transitions in 10 ms returned []
Running 1000 sub problems to find dead transitions.
[2024-05-26 06:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30028 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30022 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61185 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-03
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 53 ms.
FORMULA Referendum-PT-1000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-03 finished in 61370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F((!p1 U (p2||G(!p1))))))))'
Support contains 1001 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 6 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-26 06:14:39] [INFO ] Invariant cache hit.
[2024-05-26 06:14:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-26 06:14:39] [INFO ] Invariant cache hit.
[2024-05-26 06:14:40] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 1000 sub problems to find dead transitions.
[2024-05-26 06:14:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30018 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30035 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Finished structural reductions in LTL mode , in 1 iterations and 61081 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-06
Product exploration explored 100000 steps with 99 reset in 4544 ms.
Product exploration explored 100000 steps with 99 reset in 4874 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-06 finished in 71339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 1001 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 14 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-26 06:15:51] [INFO ] Invariant cache hit.
[2024-05-26 06:15:51] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-26 06:15:51] [INFO ] Invariant cache hit.
[2024-05-26 06:15:51] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 1000 sub problems to find dead transitions.
[2024-05-26 06:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30027 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30087 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60937ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60945ms
Finished structural reductions in LTL mode , in 1 iterations and 61558 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-1000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-07 finished in 61869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((X(p0)||(p1&&X(F(p2)))))))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 997 places :
Symmetric choice reduction at 0 with 997 rule applications. Total rules 997 place count 4 transition count 4
Iterating global reduction 0 with 997 rules applied. Total rules applied 1994 place count 4 transition count 4
Applied a total of 1994 rules in 14 ms. Remains 4 /1001 variables (removed 997) and now considering 4/1001 (removed 997) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-26 06:16:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 06:16:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-26 06:16:52] [INFO ] Invariant cache hit.
[2024-05-26 06:16:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-05-26 06:16:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 109 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 58 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 185ms
Starting structural reductions in LTL mode, iteration 1 : 4/1001 places, 4/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 4/1001 places, 4/1001 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-09
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-1000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-09 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p0) U G(p1))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 14 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 06:16:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 06:16:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 06:16:53] [INFO ] Invariant cache hit.
[2024-05-26 06:16:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 06:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-10
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-1000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-10 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 2 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.2 ms
Discarding 999 places :
Also discarding 999 output transitions
Drop transitions (Output transitions of discarded places.) removed 999 transitions
Applied a total of 1 rules in 10 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 06:16:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 06:16:53] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-26 06:16:53] [INFO ] Invariant cache hit.
[2024-05-26 06:16:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-26 06:16:53] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-26 06:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Domain max(s): 2/2 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Domain max(s): 2/2 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1001 places, 2/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 2/1001 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 34 ms.
Product exploration explored 100000 steps with 33333 reset in 42 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT 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 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-11 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 2 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.3 ms
Discarding 999 places :
Also discarding 999 output transitions
Drop transitions (Output transitions of discarded places.) removed 999 transitions
Applied a total of 1 rules in 5 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
[2024-05-26 06:16:54] [INFO ] Invariant cache hit.
[2024-05-26 06:16:54] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-26 06:16:54] [INFO ] Invariant cache hit.
[2024-05-26 06:16:54] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-26 06:16:54] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-26 06:16:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Domain max(s): 2/2 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Domain max(s): 2/2 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1001 places, 2/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 2/1001 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-13
Product exploration explored 100000 steps with 40035 reset in 36 ms.
Product exploration explored 100000 steps with 40053 reset in 44 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 11 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-13 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 12 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 06:16:54] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 06:16:54] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-26 06:16:54] [INFO ] Invariant cache hit.
[2024-05-26 06:16:54] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 06:16:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Starting structural reductions in LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-14 finished in 235 ms.
All properties solved by simple procedures.
Total runtime 327159 ms.
BK_STOP 1716704215028
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Referendum-PT-1000"
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-5568"
echo " Executing tool itstools"
echo " Input is Referendum-PT-1000, 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 r312-tall-171662339000636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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 '
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 ;