About the Execution of GreatSPN+red for Referendum-PT-0500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1854.220 | 503853.00 | 617471.00 | 1404.20 | TTFTTTFFFFFFTFFF | 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.r311-tall-171662337000627.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 greatspnxred
Input is Referendum-PT-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000627
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 641K Apr 11 20:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K Apr 11 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 17:43 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 246K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 813K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 286K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 339K Apr 12 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 614K Apr 11 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 11 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 124K 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 571K 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-0500-LTLCardinality-00
FORMULA_NAME Referendum-PT-0500-LTLCardinality-01
FORMULA_NAME Referendum-PT-0500-LTLCardinality-02
FORMULA_NAME Referendum-PT-0500-LTLCardinality-03
FORMULA_NAME Referendum-PT-0500-LTLCardinality-04
FORMULA_NAME Referendum-PT-0500-LTLCardinality-05
FORMULA_NAME Referendum-PT-0500-LTLCardinality-06
FORMULA_NAME Referendum-PT-0500-LTLCardinality-07
FORMULA_NAME Referendum-PT-0500-LTLCardinality-08
FORMULA_NAME Referendum-PT-0500-LTLCardinality-09
FORMULA_NAME Referendum-PT-0500-LTLCardinality-10
FORMULA_NAME Referendum-PT-0500-LTLCardinality-11
FORMULA_NAME Referendum-PT-0500-LTLCardinality-12
FORMULA_NAME Referendum-PT-0500-LTLCardinality-13
FORMULA_NAME Referendum-PT-0500-LTLCardinality-14
FORMULA_NAME Referendum-PT-0500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716763248170
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:40:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 22:40:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:40:49] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-26 22:40:49] [INFO ] Transformed 1501 places.
[2024-05-26 22:40:49] [INFO ] Transformed 1001 transitions.
[2024-05-26 22:40:49] [INFO ] Found NUPN structural information;
[2024-05-26 22:40:49] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 21 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2024-05-26 22:40:49] [INFO ] Computed 500 invariants in 23 ms
[2024-05-26 22:40:50] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-26 22:40:50] [INFO ] Invariant cache hit.
[2024-05-26 22:40:51] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
Running 1000 sub problems to find dead transitions.
[2024-05-26 22:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 1001/2001 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1501/2502 variables, and 2001 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30060 ms.
Refiners :[Domain max(s): 1501/1501 constraints, Positive P Invariants (semi-flows): 500/500 constraints, State Equation: 0/1501 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/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 1001/2001 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/2001 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 5 (OVERLAPS) 1001/2502 variables, 1501/3502 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2502/2502 variables, and 4502 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30140 ms.
Refiners :[Domain max(s): 1501/1501 constraints, Positive P Invariants (semi-flows): 500/500 constraints, State Equation: 1501/1501 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60799ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60925ms
Finished structural reductions in LTL mode , in 1 iterations and 62257 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Support contains 1501 out of 1501 places after structural reductions.
[2024-05-26 22:41:52] [INFO ] Flatten gal took : 176 ms
[2024-05-26 22:41:52] [INFO ] Flatten gal took : 87 ms
[2024-05-26 22:41:52] [INFO ] Input system was already deterministic with 1001 transitions.
RANDOM walk for 40000 steps (76 resets) in 7059 ms. (5 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2154 ms. (18 steps per ms) remains 1/1 properties
[2024-05-26 22:41:55] [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
At refinement iteration 2 (OVERLAPS) 500/1501 variables, 500/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 500/2001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/2001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1001/2502 variables, 1501/3502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2502 variables, 0/3502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2502 variables, 0/3502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2502/2502 variables, and 3502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[Domain max(s): 1501/1501 constraints, Positive P Invariants (semi-flows): 500/500 constraints, State Equation: 1501/1501 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/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
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 1501/2502 variables, and 1501 constraints, problems are : Problem set: 1 solved, 0 unsolved in 642 ms.
Refiners :[Domain max(s): 1001/1501 constraints, Positive P Invariants (semi-flows): 500/500 constraints, State Equation: 0/1501 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2669ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 1501 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1501 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))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 1001 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.6 ms
Discarding 500 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-26 22:41:58] [INFO ] Computed 0 invariants in 7 ms
[2024-05-26 22:41:58] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-26 22:41:58] [INFO ] Invariant cache hit.
[2024-05-26 22:41:58] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-26 22:41:58] [INFO ] Redundant transitions in 61 ms returned []
Running 1000 sub problems to find dead transitions.
[2024-05-26 22:41:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
SMT process timed out in 30343ms, After SMT, problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 30351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31101 ms. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 5916 ms.
Product exploration explored 100000 steps with 50000 reset in 5819 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 : [(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 25 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-00 finished in 43345 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 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 501 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 501 transition count 501
Applied a total of 501 rules in 33 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2024-05-26 22:42:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 22:42:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-26 22:42:41] [INFO ] Invariant cache hit.
[2024-05-26 22:42:41] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-26 22:42:41] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-26 22:42:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 501/1001 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 1/1002 variables, 1/1001 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1002 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30019 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 501/1001 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 500/1500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (OVERLAPS) 1/1002 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1502 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30013 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60477 ms. Remains : 501/1501 places, 501/1001 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-04
Product exploration explored 100000 steps with 389 reset in 4125 ms.
Product exploration explored 100000 steps with 399 reset in 4313 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (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-0500-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-04 finished in 69183 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 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 501 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.3 ms
Discarding 1000 places :
Also discarding 0 output transitions
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 501 transition count 501
Applied a total of 501 rules in 19 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
[2024-05-26 22:43:50] [INFO ] Invariant cache hit.
[2024-05-26 22:43:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 22:43:50] [INFO ] Invariant cache hit.
[2024-05-26 22:43:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-26 22:43:51] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2024-05-26 22:43:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 501/1001 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 1/1002 variables, 1/1001 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1002 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30017 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 501/1001 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 500/1500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (OVERLAPS) 1/1002 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1502 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30022 ms.
Refiners :[Domain max(s): 501/501 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60466 ms. Remains : 501/1501 places, 501/1001 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-05
Product exploration explored 100000 steps with 199 reset in 5574 ms.
Product exploration explored 100000 steps with 199 reset in 5749 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-05 finished in 72006 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 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 1001 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.6 ms
Discarding 500 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1001 transition count 1001
Applied a total of 2 rules in 124 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-26 22:45:02] [INFO ] Computed 0 invariants in 5 ms
[2024-05-26 22:45:02] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-26 22:45:02] [INFO ] Invariant cache hit.
[2024-05-26 22:45:03] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-05-26 22:45:03] [INFO ] Redundant transitions in 16 ms returned []
Running 999 sub problems to find dead transitions.
[2024-05-26 22:45:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 999 unsolved
SMT process timed out in 30560ms, After SMT, problems are : Problem set: 0 solved, 999 unsolved
Search for dead transitions found 0 dead transitions in 30569ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31339 ms. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-06
Product exploration explored 100000 steps with 1233 reset in 5639 ms.
Product exploration explored 100000 steps with 1112 reset in 5836 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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 7 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-26 22:45:46] [INFO ] Invariant cache hit.
[2024-05-26 22:45:48] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-26 22:45:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:45:51] [INFO ] [Nat]Absence check using state equation in 1300 ms returned sat
[2024-05-26 22:45:51] [INFO ] Computed and/alt/rep : 999/1997/999 causal constraints (skipped 0 transitions) in 52 ms.
[2024-05-26 22:45:57] [INFO ] Added : 499 causal constraints over 100 iterations in 5239 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 501 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 32 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-26 22:45:57] [INFO ] Invariant cache hit.
[2024-05-26 22:45:57] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-26 22:45:57] [INFO ] Invariant cache hit.
[2024-05-26 22:45:57] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-26 22:45:57] [INFO ] Redundant transitions in 17 ms returned []
Running 999 sub problems to find dead transitions.
[2024-05-26 22:45:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 999 unsolved
SMT process timed out in 30489ms, After SMT, problems are : Problem set: 0 solved, 999 unsolved
Search for dead transitions found 0 dead transitions in 30498ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31184 ms. Remains : 1001/1001 places, 1001/1001 transitions.
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-26 22:46:29] [INFO ] Invariant cache hit.
[2024-05-26 22:46:31] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2024-05-26 22:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:46:34] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2024-05-26 22:46:34] [INFO ] Computed and/alt/rep : 999/1997/999 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-26 22:46:39] [INFO ] Added : 499 causal constraints over 100 iterations in 4985 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1096 reset in 5530 ms.
Product exploration explored 100000 steps with 1190 reset in 5695 ms.
Support contains 501 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 28 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-26 22:46:50] [INFO ] Invariant cache hit.
[2024-05-26 22:46:50] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-26 22:46:50] [INFO ] Invariant cache hit.
[2024-05-26 22:46:51] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-26 22:46:51] [INFO ] Redundant transitions in 14 ms returned []
Running 999 sub problems to find dead transitions.
[2024-05-26 22:46:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 999 unsolved
SMT process timed out in 30442ms, After SMT, problems are : Problem set: 0 solved, 999 unsolved
Search for dead transitions found 0 dead transitions in 30451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31083 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Treatment of property Referendum-PT-0500-LTLCardinality-06 finished in 139092 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)||G(p1))))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 31 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2024-05-26 22:47:21] [INFO ] Computed 500 invariants in 5 ms
[2024-05-26 22:47:22] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-26 22:47:22] [INFO ] Invariant cache hit.
[2024-05-26 22:47:22] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2024-05-26 22:47:22] [INFO ] Redundant transitions in 14 ms returned []
Running 1000 sub problems to find dead transitions.
[2024-05-26 22:47:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 1001/2001 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1501/2502 variables, and 2001 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30018 ms.
Refiners :[Domain max(s): 1501/1501 constraints, Positive P Invariants (semi-flows): 500/500 constraints, State Equation: 0/1501 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/500 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/1501 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1501 variables, 1001/2001 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/2001 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 5 (OVERLAPS) 1001/2502 variables, 1501/3502 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2502 variables, 1000/4502 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2502/2502 variables, and 4502 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30026 ms.
Refiners :[Domain max(s): 1501/1501 constraints, Positive P Invariants (semi-flows): 500/500 constraints, State Equation: 1501/1501 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61493 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-07
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 124 ms.
FORMULA Referendum-PT-0500-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-07 finished in 61675 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)))'
Support contains 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 999 places and 0 transitions.
Ensure Unique test removed 499 transitions
Reduce isomorphic transitions removed 499 transitions.
Iterating post reduction 0 with 1498 rules applied. Total rules applied 1498 place count 502 transition count 502
Discarding 497 places :
Symmetric choice reduction at 1 with 497 rule applications. Total rules 1995 place count 5 transition count 5
Iterating global reduction 1 with 497 rules applied. Total rules applied 2492 place count 5 transition count 5
Applied a total of 2492 rules in 24 ms. Remains 5 /1501 variables (removed 1496) and now considering 5/1001 (removed 996) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-26 22:48:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 22:48:23] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-26 22:48:23] [INFO ] Invariant cache hit.
[2024-05-26 22:48:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-05-26 22:48:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in LTL mode, iteration 1 : 5/1501 places, 5/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 5/1501 places, 5/1001 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-09 finished in 222 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' '!((p0 U X(X(p1))))'
Support contains 3 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 998 places and 0 transitions.
Ensure Unique test removed 498 transitions
Reduce isomorphic transitions removed 498 transitions.
Iterating post reduction 0 with 1496 rules applied. Total rules applied 1496 place count 503 transition count 503
Discarding 497 places :
Symmetric choice reduction at 1 with 497 rule applications. Total rules 1993 place count 6 transition count 6
Iterating global reduction 1 with 497 rules applied. Total rules applied 2490 place count 6 transition count 6
Applied a total of 2490 rules in 14 ms. Remains 6 /1501 variables (removed 1495) and now considering 6/1001 (removed 995) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-26 22:48:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 22:48:23] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 22:48:23] [INFO ] Invariant cache hit.
[2024-05-26 22:48:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-05-26 22:48:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Starting structural reductions in LTL mode, iteration 1 : 6/1501 places, 6/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 6/1501 places, 6/1001 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 32 steps with 10 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-10 finished in 383 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 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 3 are kept as prefixes of interest. Removing 1498 places using SCC suffix rule.1 ms
Discarding 1498 places :
Also discarding 998 output transitions
Drop transitions (Output transitions of discarded places.) removed 998 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 4 ms. Remains 3 /1501 variables (removed 1498) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 22:48:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 22:48:24] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-26 22:48:24] [INFO ] Invariant cache hit.
[2024-05-26 22:48:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-26 22:48:24] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-26 22:48:24] [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) 3/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17 ms.
Refiners :[Domain max(s): 3/3 constraints, State Equation: 3/3 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, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Domain max(s): 3/3 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 43ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1501 places, 3/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 3/1501 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-13 finished in 180 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)))'
[2024-05-26 22:48:24] [INFO ] Flatten gal took : 50 ms
[2024-05-26 22:48:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-26 22:48:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1501 places, 1001 transitions and 2501 arcs took 8 ms.
Total runtime 455283 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Referendum-PT-0500
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1501
TRANSITIONS: 1001
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.004s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 959
MODEL NAME: /home/mcc/execution/411/model
1501 places, 1001 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Referendum-PT-0500-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716763752023
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-0500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Referendum-PT-0500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662337000627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0500.tgz
mv Referendum-PT-0500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;