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.r544-smll-171701111200275.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 ltsminxred
Input is UtilityControlRoom-PT-Z4T4N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111200275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 69K Apr 13 06:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 343K Apr 13 06:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 13 05:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 544K Apr 13 05:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 32K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 112K Apr 13 06:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 515K Apr 13 06:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 103K Apr 13 06:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 403K Apr 13 06:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 319K 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 UtilityControlRoom-PT-Z4T4N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717279596026

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:06:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 22:06:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:06:38] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-01 22:06:38] [INFO ] Transformed 376 places.
[2024-06-01 22:06:38] [INFO ] Transformed 750 transitions.
[2024-06-01 22:06:38] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 318 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 24 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-06-01 22:06:38] [INFO ] Computed 23 invariants in 30 ms
[2024-06-01 22:06:39] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-01 22:06:39] [INFO ] Invariant cache hit.
[2024-06-01 22:06:39] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 22:06:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/376 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/966 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/966 variables, and 399 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/376 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/966 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/966 variables, 580/979 constraints. Problems are: Problem set: 0 solved, 580 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 Int declared 966/966 variables, and 979 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61634ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61691ms
Finished structural reductions in LTL mode , in 1 iterations and 62800 ms. Remains : 376/376 places, 590/590 transitions.
Support contains 318 out of 376 places after structural reductions.
[2024-06-01 22:07:41] [INFO ] Flatten gal took : 106 ms
[2024-06-01 22:07:41] [INFO ] Flatten gal took : 59 ms
[2024-06-01 22:07:42] [INFO ] Input system was already deterministic with 590 transitions.
RANDOM walk for 40000 steps (8 resets) in 2385 ms. (16 steps per ms) remains 7/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
[2024-06-01 22:07:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 360/966 variables, and 15 constraints, problems are : Problem set: 5 solved, 0 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 80 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 47 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-06-01 22:07:43] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 22:07:44] [INFO ] Implicit Places using invariants in 283 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 8 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-02 finished in 733 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(((p0 U p1)||(p2&&G(p3)))))'
Support contains 204 out of 376 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 366 transition count 580
Applied a total of 20 rules in 52 ms. Remains 366 /376 variables (removed 10) and now considering 580/590 (removed 10) transitions.
// Phase 1: matrix 580 rows 366 cols
[2024-06-01 22:07:44] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 22:07:44] [INFO ] Implicit Places using invariants in 239 ms returned [295]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 365/376 places, 580/590 transitions.
Applied a total of 0 rules in 23 ms. Remains 365 /365 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 321 ms. Remains : 365/376 places, 580/590 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03
Product exploration explored 100000 steps with 3798 reset in 1801 ms.
Product exploration explored 100000 steps with 3803 reset in 1579 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3)), (X p2), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) p2 p3))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p3))), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 939 ms. (42 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 1/1 properties
// Phase 1: matrix 580 rows 365 cols
[2024-06-01 22:07:49] [INFO ] Computed 22 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 365/945 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3)), (X p2), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) p2 p3))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p3))), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p3)))), (G (OR p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (F (NOT (OR p1 (NOT p3)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p3)))), (F p3)]
Knowledge based reduction with 16 factoid took 376 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2024-06-01 22:07:49] [INFO ] Invariant cache hit.
[2024-06-01 22:07:50] [INFO ] [Real]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-06-01 22:07:50] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2024-06-01 22:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:07:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-06-01 22:07:51] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-06-01 22:07:51] [INFO ] Computed and/alt/rep : 540/1000/540 causal constraints (skipped 0 transitions) in 59 ms.
[2024-06-01 22:07:57] [INFO ] Added : 540 causal constraints over 108 iterations in 5870 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 40 out of 365 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 580/580 transitions.
Applied a total of 0 rules in 19 ms. Remains 365 /365 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2024-06-01 22:07:57] [INFO ] Invariant cache hit.
[2024-06-01 22:07:57] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 22:07:57] [INFO ] Invariant cache hit.
[2024-06-01 22:07:58] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-06-01 22:07:58] [INFO ] Redundant transitions in 41 ms returned []
Running 540 sub problems to find dead transitions.
[2024-06-01 22:07:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/365 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 580/945 variables, 365/387 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/945 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 540 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 945/945 variables, and 387 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/365 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 580/945 variables, 365/387 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/945 variables, 540/927 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 945/945 variables, and 927 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 61252ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 61261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62135 ms. Remains : 365/365 places, 580/580 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
RANDOM walk for 93 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
[2024-06-01 22:09:00] [INFO ] Invariant cache hit.
[2024-06-01 22:09:00] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-06-01 22:09:01] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-06-01 22:09:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:09:01] [INFO ] [Nat]Absence check using 22 positive place invariants in 23 ms returned sat
[2024-06-01 22:09:02] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-06-01 22:09:02] [INFO ] Computed and/alt/rep : 540/1000/540 causal constraints (skipped 0 transitions) in 51 ms.
[2024-06-01 22:09:07] [INFO ] Added : 540 causal constraints over 108 iterations in 5703 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 54 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3790 reset in 441 ms.
Product exploration explored 100000 steps with 3794 reset in 460 ms.
Support contains 40 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 580/580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 365 transition count 420
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 205 transition count 380
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 205 transition count 340
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 165 transition count 340
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 162 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 162 transition count 220
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 467 place count 151 transition count 210
Applied a total of 467 rules in 52 ms. Remains 151 /365 variables (removed 214) and now considering 210/580 (removed 370) transitions.
// Phase 1: matrix 210 rows 151 cols
[2024-06-01 22:09:08] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 22:09:09] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 22:09:09] [INFO ] Invariant cache hit.
[2024-06-01 22:09:09] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-01 22:09:09] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-06-01 22:09:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 172 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6425 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 170/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 342 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7946 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 14459ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 14462ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/365 places, 210/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14875 ms. Remains : 151/365 places, 210/580 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03 finished in 99398 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)))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 14 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-06-01 22:09:23] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 22:09:24] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 22:09:24] [INFO ] Invariant cache hit.
[2024-06-01 22:09:24] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 22:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29032 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60877 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-04 finished in 61594 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((G(p0)||X(F(p1)))))'
Support contains 171 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 376 transition count 550
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 336 transition count 550
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 120 place count 316 transition count 530
Applied a total of 120 rules in 60 ms. Remains 316 /376 variables (removed 60) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 316 cols
[2024-06-01 22:10:25] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 22:10:26] [INFO ] Implicit Places using invariants in 424 ms returned [254]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 428 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/376 places, 530/590 transitions.
Applied a total of 0 rules in 11 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 500 ms. Remains : 315/376 places, 530/590 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 646 ms.
Stack based approach found an accepted trace after 14356 steps with 0 reset with depth 14357 and stack size 14357 in 100 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-06 finished in 1348 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 11 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 83 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 83 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 83 transition count 80
Applied a total of 656 rules in 48 ms. Remains 83 /376 variables (removed 293) and now considering 80/590 (removed 510) transitions.
// Phase 1: matrix 80 rows 83 cols
[2024-06-01 22:10:26] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 22:10:27] [INFO ] Implicit Places using invariants in 77 ms returned [0, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/376 places, 80/590 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 81 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 71 transition count 70
Applied a total of 20 rules in 4 ms. Remains 71 /81 variables (removed 10) and now considering 70/80 (removed 10) transitions.
// Phase 1: matrix 70 rows 71 cols
[2024-06-01 22:10:27] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 22:10:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 22:10:27] [INFO ] Invariant cache hit.
[2024-06-01 22:10:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/376 places, 70/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 71/376 places, 70/590 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07
Product exploration explored 100000 steps with 11797 reset in 207 ms.
Stack based approach found an accepted trace after 9361 steps with 1113 reset with depth 10 and stack size 10 in 25 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-07 finished in 599 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||F(p1)))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 376 transition count 434
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 354 place count 220 transition count 392
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 358 place count 217 transition count 391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 358 place count 217 transition count 351
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 438 place count 177 transition count 351
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 440 place count 175 transition count 271
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 175 transition count 271
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 461 place count 156 transition count 252
Iterating global reduction 3 with 19 rules applied. Total rules applied 480 place count 156 transition count 252
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 499 place count 137 transition count 214
Iterating global reduction 3 with 19 rules applied. Total rules applied 518 place count 137 transition count 214
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 536 place count 119 transition count 178
Iterating global reduction 3 with 18 rules applied. Total rules applied 554 place count 119 transition count 178
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 572 place count 119 transition count 160
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 610 place count 100 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 612 place count 99 transition count 140
Applied a total of 612 rules in 46 ms. Remains 99 /376 variables (removed 277) and now considering 140/590 (removed 450) transitions.
// Phase 1: matrix 140 rows 99 cols
[2024-06-01 22:10:27] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 22:10:27] [INFO ] Implicit Places using invariants in 132 ms returned [56, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 138 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/376 places, 140/590 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 77 transition count 120
Applied a total of 40 rules in 7 ms. Remains 77 /97 variables (removed 20) and now considering 120/140 (removed 20) transitions.
// Phase 1: matrix 120 rows 77 cols
[2024-06-01 22:10:27] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 22:10:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 22:10:27] [INFO ] Invariant cache hit.
[2024-06-01 22:10:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/376 places, 120/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 77/376 places, 120/590 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08
Product exploration explored 100000 steps with 318 reset in 305 ms.
Stack based approach found an accepted trace after 43161 steps with 122 reset with depth 49 and stack size 49 in 142 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-08 finished in 927 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((X(X(p0))||X(!(p1 U p2))||F(!p1))))'
Support contains 5 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 257 transition count 471
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 257 transition count 471
Applied a total of 238 rules in 15 ms. Remains 257 /376 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 257 cols
[2024-06-01 22:10:28] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:10:28] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 22:10:28] [INFO ] Invariant cache hit.
[2024-06-01 22:10:29] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-01 22:10:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 280 constraints, problems are : Problem set: 0 solved, 461 unsolved in 29714 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 461/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 741 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60783ms
Starting structural reductions in LTL mode, iteration 1 : 257/376 places, 471/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61407 ms. Remains : 257/376 places, 471/590 transitions.
Stuttering acceptance computed with spot in 402 ms :[(AND p1 (NOT p0)), p1, (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09
Product exploration explored 100000 steps with 74 reset in 415 ms.
Product exploration explored 100000 steps with 60 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 285 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
RANDOM walk for 2899 steps (0 resets) in 39 ms. (72 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (AND p1 p2))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 483 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 303 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
[2024-06-01 22:11:32] [INFO ] Invariant cache hit.
[2024-06-01 22:11:33] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2024-06-01 22:11:33] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-06-01 22:11:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:11:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2024-06-01 22:11:34] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2024-06-01 22:11:34] [INFO ] Computed and/alt/rep : 421/691/421 causal constraints (skipped 40 transitions) in 49 ms.
[2024-06-01 22:11:35] [INFO ] Added : 114 causal constraints over 23 iterations in 831 ms. Result :sat
Could not prove EG (AND p1 (NOT p0) p2)
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 471/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 257 /257 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2024-06-01 22:11:35] [INFO ] Invariant cache hit.
[2024-06-01 22:11:35] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-01 22:11:35] [INFO ] Invariant cache hit.
[2024-06-01 22:11:35] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-01 22:11:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 280 constraints, problems are : Problem set: 0 solved, 461 unsolved in 29701 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 461/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 741 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
After SMT, in 60728ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60735ms
Finished structural reductions in LTL mode , in 1 iterations and 61553 ms. Remains : 257/257 places, 471/471 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
RANDOM walk for 4932 steps (0 resets) in 36 ms. (133 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 (NOT p0) p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 349 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 293 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
[2024-06-01 22:12:38] [INFO ] Invariant cache hit.
[2024-06-01 22:12:38] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2024-06-01 22:12:38] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-06-01 22:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:12:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2024-06-01 22:12:39] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2024-06-01 22:12:39] [INFO ] Computed and/alt/rep : 421/691/421 causal constraints (skipped 40 transitions) in 43 ms.
[2024-06-01 22:12:40] [INFO ] Added : 114 causal constraints over 23 iterations in 820 ms. Result :sat
Could not prove EG (AND p1 (NOT p0) p2)
Stuttering acceptance computed with spot in 293 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
Product exploration explored 100000 steps with 70 reset in 434 ms.
Product exploration explored 100000 steps with 46 reset in 442 ms.
Applying partial POR strategy [true, true, false, true, true, false, false]
Stuttering acceptance computed with spot in 284 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 471/471 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 257 transition count 511
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 257 transition count 511
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 0 with 57 rules applied. Total rules applied 97 place count 257 transition count 532
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 137 place count 257 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 255 transition count 412
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 255 transition count 412
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 161 place count 235 transition count 392
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 181 place count 235 transition count 392
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 221 place count 195 transition count 312
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 261 place count 195 transition count 312
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 298 place count 158 transition count 258
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 335 place count 158 transition count 258
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 365 place count 158 transition count 228
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 365 rules in 44 ms. Remains 158 /257 variables (removed 99) and now considering 228/471 (removed 243) transitions.
[2024-06-01 22:12:42] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
// Phase 1: matrix 228 rows 158 cols
[2024-06-01 22:12:42] [INFO ] Computed 23 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 22:12:43] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 10/158 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 22:12:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 10/34 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/34 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 228/386 variables, 158/192 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/192 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/192 constraints. Problems are: Problem set: 85 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 192 constraints, problems are : Problem set: 85 solved, 125 unsolved in 8217 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 85 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 67/158 variables, 23/24 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/34 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/34 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 228/386 variables, 158/192 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 125/317 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/317 constraints. Problems are: Problem set: 85 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/317 constraints. Problems are: Problem set: 85 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 317 constraints, problems are : Problem set: 85 solved, 125 unsolved in 6659 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 125/210 constraints, Known Traps: 11/11 constraints]
After SMT, in 14989ms problems are : Problem set: 85 solved, 125 unsolved
Search for dead transitions found 85 dead transitions in 14993ms
Found 85 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 85 transitions
Dead transitions reduction (with SMT) removed 85 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/257 places, 143/471 transitions.
Graph (complete) has 276 edges and 158 vertex of which 101 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.1 ms
Discarding 57 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 101 /158 variables (removed 57) and now considering 143/143 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/257 places, 143/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15058 ms. Remains : 101/257 places, 143/471 transitions.
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 471/471 transitions.
Applied a total of 0 rules in 4 ms. Remains 257 /257 variables (removed 0) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 257 cols
[2024-06-01 22:12:57] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:12:57] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 22:12:57] [INFO ] Invariant cache hit.
[2024-06-01 22:12:57] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-01 22:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 280 constraints, problems are : Problem set: 0 solved, 461 unsolved in 29203 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 461/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 741 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Finished structural reductions in LTL mode , in 1 iterations and 60997 ms. Remains : 257/257 places, 471/471 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09 finished in 209757 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 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 376 transition count 431
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 358 place count 217 transition count 391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 358 place count 217 transition count 351
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 438 place count 177 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 440 place count 175 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 442 place count 175 transition count 271
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 462 place count 155 transition count 251
Iterating global reduction 2 with 20 rules applied. Total rules applied 482 place count 155 transition count 251
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 502 place count 135 transition count 211
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 135 transition count 211
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 541 place count 116 transition count 173
Iterating global reduction 2 with 19 rules applied. Total rules applied 560 place count 116 transition count 173
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 579 place count 116 transition count 154
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 617 place count 97 transition count 135
Applied a total of 617 rules in 49 ms. Remains 97 /376 variables (removed 279) and now considering 135/590 (removed 455) transitions.
// Phase 1: matrix 135 rows 97 cols
[2024-06-01 22:13:58] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 22:13:58] [INFO ] Implicit Places using invariants in 485 ms returned [55, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 488 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/376 places, 135/590 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 75 transition count 115
Applied a total of 40 rules in 6 ms. Remains 75 /95 variables (removed 20) and now considering 115/135 (removed 20) transitions.
// Phase 1: matrix 115 rows 75 cols
[2024-06-01 22:13:58] [INFO ] Computed 21 invariants in 3 ms
[2024-06-01 22:13:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 22:13:58] [INFO ] Invariant cache hit.
[2024-06-01 22:13:58] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/376 places, 115/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 784 ms. Remains : 75/376 places, 115/590 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 318 ms.
Stack based approach found an accepted trace after 484 steps with 0 reset with depth 485 and stack size 485 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-11 finished in 1166 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(X((p0 U (G(p0)||(p0&&G((p1||(X(p2) U ((p0&&X(p2))||X(G(p2))))))))))))'
Support contains 5 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 18 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-06-01 22:13:59] [INFO ] Computed 23 invariants in 10 ms
[2024-06-01 22:13:59] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 22:13:59] [INFO ] Invariant cache hit.
[2024-06-01 22:14:00] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 22:14:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29427 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60511ms
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61253 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 440 ms.
Product exploration explored 100000 steps with 0 reset in 502 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 560 ms. (71 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2024-06-01 22:15:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 200/205 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf7 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 256/726 variables, and 23 constraints, problems are : Problem set: 2 solved, 0 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/256 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (OR p0 p1 (NOT p2))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 7 factoid took 630 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 323 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 22:15:04] [INFO ] Invariant cache hit.
[2024-06-01 22:15:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 22:15:04] [INFO ] Invariant cache hit.
[2024-06-01 22:15:04] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 22:15:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29032 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 2)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 59960ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59967ms
Finished structural reductions in LTL mode , in 1 iterations and 60677 ms. Remains : 256/256 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 1/9 properties
BEST_FIRST walk for 5881 steps (0 resets) in 9 ms. (588 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (OR (NOT p0) p1) (OR p1 (NOT p2))))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 333 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 307 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 0 reset in 504 ms.
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 22:16:07] [INFO ] Invariant cache hit.
[2024-06-01 22:16:08] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-01 22:16:08] [INFO ] Invariant cache hit.
[2024-06-01 22:16:08] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 22:16:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 28104 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 59073ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59082ms
Finished structural reductions in LTL mode , in 1 iterations and 59836 ms. Remains : 256/256 places, 470/470 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14 finished in 188492 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(((p0 U p1)||(p2&&G(p3)))))'
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((X(X(p0))||X(!(p1 U p2))||F(!p1))))'
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(X((p0 U (G(p0)||(p0&&G((p1||(X(p2) U ((p0&&X(p2))||X(G(p2))))))))))))'
[2024-06-01 22:17:08] [INFO ] Flatten gal took : 51 ms
[2024-06-01 22:17:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 22:17:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 376 places, 590 transitions and 1770 arcs took 11 ms.
Total runtime 630630 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03
Could not compute solution for formula : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09
Could not compute solution for formula : UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14

BK_STOP 1717281505262

--------------------
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
mcc2024
ltl formula name UtilityControlRoom-PT-Z4T4N10-LTLCardinality-03
ltl formula formula --ltl=/tmp/1694/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 376 places, 590 transitions and 1770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1694/ltl_0_
ltl formula name UtilityControlRoom-PT-Z4T4N10-LTLCardinality-09
ltl formula formula --ltl=/tmp/1694/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 376 places, 590 transitions and 1770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 378 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 377, there are 600 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2499 levels ~10000 states ~77492 transitions
pnml2lts-mc( 2/ 4): ~4999 levels ~20000 states ~157108 transitions
pnml2lts-mc( 2/ 4): ~9999 levels ~40000 states ~318160 transitions
pnml2lts-mc( 2/ 4): ~19999 levels ~80000 states ~634988 transitions
pnml2lts-mc( 2/ 4): ~39999 levels ~160000 states ~1277860 transitions
pnml2lts-mc( 2/ 4): ~79999 levels ~320000 states ~2569312 transitions
pnml2lts-mc( 2/ 4): ~159999 levels ~640000 states ~5158880 transitions
pnml2lts-mc( 2/ 4): ~319999 levels ~1280000 states ~10376324 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 2261358
pnml2lts-mc( 0/ 4): unique transitions count: 19722015
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2379322
pnml2lts-mc( 0/ 4): - claim success count: 2261361
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2261360
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2261361 states 19722045 transitions, fanout: 8.721
pnml2lts-mc( 0/ 4): Total exploration time 41.550 sec (41.460 sec minimum, 41.498 sec on average)
pnml2lts-mc( 0/ 4): States per second: 54425, Transitions per second: 474658
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 187.7MB, 12.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 48.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 602 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 187.7MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z4T4N10-LTLCardinality-14
ltl formula formula --ltl=/tmp/1694/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 376 places, 590 transitions and 1770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1694/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1694/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1694/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1694/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 378 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 377, there are 615 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~72664 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~146768 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~293516 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~586348 transitions
pnml2lts-mc( 2/ 4): ~39966 levels ~160000 states ~1200404 transitions
pnml2lts-mc( 2/ 4): ~79938 levels ~320000 states ~2441724 transitions
pnml2lts-mc( 2/ 4): ~159906 levels ~640000 states ~4816256 transitions
pnml2lts-mc( 2/ 4): ~319775 levels ~1280000 states ~9688880 transitions
pnml2lts-mc( 2/ 4): ~639395 levels ~2560000 states ~19513076 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2535087
pnml2lts-mc( 0/ 4): unique transitions count: 21345962
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3362097
pnml2lts-mc( 0/ 4): - claim success count: 2535091
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2534313
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2535091 states 21346009 transitions, fanout: 8.420
pnml2lts-mc( 0/ 4): Total exploration time 43.760 sec (43.730 sec minimum, 43.747 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57932, Transitions per second: 487797
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 190.2MB, 12.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 49.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 602 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 190.2MB (~256.0MB paged-in)

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="UtilityControlRoom-PT-Z4T4N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtilityControlRoom-PT-Z4T4N10, 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 r544-smll-171701111200275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T4N10.tgz
mv UtilityControlRoom-PT-Z4T4N10 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;