Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446800284.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S04J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717254171996

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:02:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:02:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:02:53] [INFO ] Load time of PNML (sax parser for PT used): 288 ms
[2024-06-01 15:02:53] [INFO ] Transformed 870 places.
[2024-06-01 15:02:53] [INFO ] Transformed 5034 transitions.
[2024-06-01 15:02:53] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 275 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Applied a total of 4 rules in 110 ms. Remains 866 /870 variables (removed 4) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 15:02:54] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 866 cols
[2024-06-01 15:02:54] [INFO ] Computed 54 invariants in 168 ms
[2024-06-01 15:02:54] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 33675ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 33727ms
[2024-06-01 15:03:27] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:03:27] [INFO ] Invariant cache hit.
[2024-06-01 15:03:28] [INFO ] Implicit Places using invariants in 803 ms returned [166, 282, 366, 367, 402, 516, 539, 633]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 815 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 858/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 20 ms. Remains 858 /858 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34729 ms. Remains : 858/870 places, 2324/2324 transitions.
Support contains 275 out of 858 places after structural reductions.
[2024-06-01 15:03:29] [INFO ] Flatten gal took : 212 ms
[2024-06-01 15:03:29] [INFO ] Flatten gal took : 133 ms
[2024-06-01 15:03:29] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 264 out of 858 places (down from 275) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (9 resets) in 1465 ms. (27 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
[2024-06-01 15:03:30] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 858 cols
[2024-06-01 15:03:30] [INFO ] Computed 46 invariants in 70 ms
[2024-06-01 15:03:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 174/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/188 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 823/3142 variables, and 27 constraints, problems are : Problem set: 1 solved, 0 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 8/14 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/858 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-12 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' '!(F(G(p0)))'
Support contains 42 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 858 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 768 transition count 2234
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 768 transition count 2174
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 708 transition count 2174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 305 place count 703 transition count 2169
Iterating global reduction 2 with 5 rules applied. Total rules applied 310 place count 703 transition count 2169
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 510 place count 603 transition count 2069
Applied a total of 510 rules in 379 ms. Remains 603 /858 variables (removed 255) and now considering 2069/2324 (removed 255) transitions.
Running 2065 sub problems to find dead transitions.
[2024-06-01 15:03:31] [INFO ] Flow matrix only has 2029 transitions (discarded 40 similar events)
// Phase 1: matrix 2029 rows 603 cols
[2024-06-01 15:03:31] [INFO ] Computed 46 invariants in 31 ms
[2024-06-01 15:03:31] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 246 places in 342 ms of which 23 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/2632 variables, and 44 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/603 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2065/2065 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 9 ms to minimize.
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 1 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 236 places in 385 ms of which 4 ms to minimize.
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 599/2632 variables, and 55 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/603 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2065 constraints, Known Traps: 14/14 constraints]
After SMT, in 54997ms problems are : Problem set: 0 solved, 2065 unsolved
Search for dead transitions found 0 dead transitions in 55030ms
[2024-06-01 15:04:26] [INFO ] Flow matrix only has 2029 transitions (discarded 40 similar events)
[2024-06-01 15:04:26] [INFO ] Invariant cache hit.
[2024-06-01 15:04:27] [INFO ] Implicit Places using invariants in 862 ms returned [498, 595]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 871 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 601/858 places, 2069/2324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 600 transition count 2068
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 600 transition count 2068
Applied a total of 2 rules in 96 ms. Remains 600 /601 variables (removed 1) and now considering 2068/2069 (removed 1) transitions.
[2024-06-01 15:04:27] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
// Phase 1: matrix 2028 rows 600 cols
[2024-06-01 15:04:27] [INFO ] Computed 44 invariants in 26 ms
[2024-06-01 15:04:28] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 15:04:28] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:04:28] [INFO ] Invariant cache hit.
[2024-06-01 15:04:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:04:52] [INFO ] Implicit Places using invariants and state equation in 24221 ms returned []
Implicit Place search using SMT with State Equation took 24974 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 600/858 places, 2068/2324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81360 ms. Remains : 600/858 places, 2068/2324 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-00
Product exploration explored 100000 steps with 5 reset in 1470 ms.
Stack based approach found an accepted trace after 3576 steps with 0 reset with depth 3577 and stack size 3577 in 38 ms.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-00 finished in 83175 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(F(((!p0&&X(F(p1)))||G(F(p1)))))||(G(!p2)&&F(((!p0&&X(F(p1)))||G(F(p1))))))))'
Support contains 68 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 77 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:04:54] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-06-01 15:04:54] [INFO ] Computed 46 invariants in 44 ms
[2024-06-01 15:04:54] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33200ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33231ms
[2024-06-01 15:05:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:05:27] [INFO ] Invariant cache hit.
[2024-06-01 15:05:28] [INFO ] Implicit Places using invariants in 847 ms returned [704, 828]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 854 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/858 places, 2304/2324 transitions.
Applied a total of 0 rules in 17 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34188 ms. Remains : 836/858 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-01
Product exploration explored 100000 steps with 1222 reset in 1491 ms.
Product exploration explored 100000 steps with 1166 reset in 1305 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 p2) p1 (NOT p0)), (X (NOT p2)), (X (OR (NOT p1) (NOT p0))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 206 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 609 ms. (65 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1357 ms. (29 steps per ms) remains 1/1 properties
[2024-06-01 15:05:32] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 15:05:32] [INFO ] Computed 44 invariants in 45 ms
[2024-06-01 15:05:32] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 190/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/360 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/816 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 3 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/819 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 834/3100 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1779ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR (NOT p1) (NOT p0))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 418 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 27 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:05:35] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:05:35] [INFO ] Invariant cache hit.
[2024-06-01 15:05:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33731ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33766ms
[2024-06-01 15:06:09] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:06:09] [INFO ] Invariant cache hit.
[2024-06-01 15:06:09] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-06-01 15:06:09] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:06:09] [INFO ] Invariant cache hit.
[2024-06-01 15:06:11] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:06:40] [INFO ] Implicit Places using invariants and state equation in 30784 ms returned []
Implicit Place search using SMT with State Equation took 31596 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:06:40] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:06:40] [INFO ] Invariant cache hit.
[2024-06-01 15:06:40] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 59 places in 362 ms of which 7 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 162 places in 371 ms of which 4 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 217 places in 440 ms of which 4 ms to minimize.
[2024-06-01 15:07:27] [INFO ] Deduced a trap composed of 427 places in 460 ms of which 5 ms to minimize.
[2024-06-01 15:07:28] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 426 places in 451 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 6/6 constraints]
After SMT, in 77715ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 77743ms
Finished structural reductions in LTL mode , in 1 iterations and 143146 ms. Remains : 836/836 places, 2304/2304 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 190 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
RANDOM walk for 1295 steps (0 resets) in 35 ms. (35 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 584 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Product exploration explored 100000 steps with 1136 reset in 1209 ms.
Product exploration explored 100000 steps with 1052 reset in 877 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 836 transition count 2304
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 60 place count 836 transition count 2304
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 836 transition count 2304
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 816 transition count 2284
Deduced a syphon composed of 60 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 816 transition count 2284
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 2 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 270 place count 816 transition count 2284
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 306 place count 780 transition count 2248
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 342 place count 780 transition count 2248
Deduced a syphon composed of 180 places in 3 ms
Applied a total of 342 rules in 308 ms. Remains 780 /836 variables (removed 56) and now considering 2248/2304 (removed 56) transitions.
Running 2244 sub problems to find dead transitions.
[2024-06-01 15:08:03] [INFO ] Flow matrix only has 2208 transitions (discarded 40 similar events)
// Phase 1: matrix 2208 rows 780 cols
[2024-06-01 15:08:03] [INFO ] Computed 44 invariants in 49 ms
[2024-06-01 15:08:03] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2988 variables, and 40 constraints, problems are : Problem set: 0 solved, 2244 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/780 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2244/2244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
[2024-06-01 15:08:46] [INFO ] Deduced a trap composed of 50 places in 385 ms of which 4 ms to minimize.
[2024-06-01 15:08:47] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 4 ms to minimize.
[2024-06-01 15:08:47] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 50 places in 648 ms of which 5 ms to minimize.
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 386 places in 522 ms of which 4 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 50 places in 608 ms of which 7 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 197 places in 541 ms of which 4 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 54 places in 619 ms of which 7 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 50 places in 588 ms of which 6 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 87 places in 558 ms of which 6 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 236 places in 386 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 288 places in 689 ms of which 6 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 272 places in 684 ms of which 5 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 248 places in 603 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 20/60 constraints. Problems are: Problem set: 12 solved, 2232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2988 variables, and 60 constraints, problems are : Problem set: 12 solved, 2232 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/780 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2244 constraints, Known Traps: 20/20 constraints]
After SMT, in 55811ms problems are : Problem set: 12 solved, 2232 unsolved
Search for dead transitions found 12 dead transitions in 55842ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 12 transitions.
[2024-06-01 15:08:59] [INFO ] Redundant transitions in 171 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 780/836 places, 2236/2304 transitions.
Graph (complete) has 4465 edges and 780 vertex of which 768 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Discarding 12 places :
Also discarding 0 output transitions
Deduced a syphon composed of 168 places in 1 ms
Applied a total of 1 rules in 94 ms. Remains 768 /780 variables (removed 12) and now considering 2236/2236 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 768/836 places, 2236/2304 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56437 ms. Remains : 768/836 places, 2236/2304 transitions.
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 21 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:08:59] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 15:08:59] [INFO ] Computed 44 invariants in 89 ms
[2024-06-01 15:08:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34948ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34972ms
[2024-06-01 15:09:34] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:09:34] [INFO ] Invariant cache hit.
[2024-06-01 15:09:35] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-06-01 15:09:35] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:09:35] [INFO ] Invariant cache hit.
[2024-06-01 15:09:36] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:10:05] [INFO ] Implicit Places using invariants and state equation in 30480 ms returned []
Implicit Place search using SMT with State Equation took 31234 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:10:05] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:10:05] [INFO ] Invariant cache hit.
[2024-06-01 15:10:05] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-06-01 15:10:43] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:10:44] [INFO ] Deduced a trap composed of 162 places in 388 ms of which 3 ms to minimize.
[2024-06-01 15:10:44] [INFO ] Deduced a trap composed of 217 places in 403 ms of which 3 ms to minimize.
[2024-06-01 15:10:48] [INFO ] Deduced a trap composed of 427 places in 415 ms of which 5 ms to minimize.
[2024-06-01 15:10:48] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 44 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-06-01 15:11:16] [INFO ] Deduced a trap composed of 426 places in 747 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 6/6 constraints]
After SMT, in 73410ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 73456ms
Finished structural reductions in LTL mode , in 1 iterations and 139703 ms. Remains : 836/836 places, 2304/2304 transitions.
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-01 finished in 385218 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))||G(p1)))'
Support contains 61 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 84 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:11:19] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-06-01 15:11:19] [INFO ] Computed 46 invariants in 96 ms
[2024-06-01 15:11:19] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34563ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34599ms
[2024-06-01 15:11:54] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:11:54] [INFO ] Invariant cache hit.
[2024-06-01 15:11:55] [INFO ] Implicit Places using invariants in 940 ms returned [704, 828]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 950 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/858 places, 2304/2324 transitions.
Applied a total of 0 rules in 25 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35665 ms. Remains : 836/858 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-02
Product exploration explored 100000 steps with 1227 reset in 539 ms.
Product exploration explored 100000 steps with 1230 reset in 553 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 332 steps (0 resets) in 13 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:11:57] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 15:11:57] [INFO ] Computed 44 invariants in 56 ms
[2024-06-01 15:11:58] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-06-01 15:11:58] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 59 ms returned sat
[2024-06-01 15:12:01] [INFO ] [Real]Absence check using state equation in 2692 ms returned sat
[2024-06-01 15:12:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:12:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-06-01 15:12:04] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 95 ms returned sat
[2024-06-01 15:12:11] [INFO ] [Nat]Absence check using state equation in 7676 ms returned sat
[2024-06-01 15:12:11] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:12:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:12:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 3115 ms returned unknown
Could not prove EG (NOT p0)
Support contains 10 out of 836 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 : 836/836 places, 2304/2304 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 836 transition count 2254
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 786 transition count 2244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 776 transition count 2244
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 120 place count 776 transition count 2144
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 320 place count 676 transition count 2144
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 500 place count 586 transition count 2054
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 506 place count 580 transition count 2048
Iterating global reduction 3 with 6 rules applied. Total rules applied 512 place count 580 transition count 2048
Applied a total of 512 rules in 224 ms. Remains 580 /836 variables (removed 256) and now considering 2048/2304 (removed 256) transitions.
Running 2044 sub problems to find dead transitions.
[2024-06-01 15:12:15] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
// Phase 1: matrix 2008 rows 580 cols
[2024-06-01 15:12:15] [INFO ] Computed 44 invariants in 81 ms
[2024-06-01 15:12:15] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 10 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:12:48] [INFO ] Deduced a trap composed of 232 places in 494 ms of which 33 ms to minimize.
[2024-06-01 15:12:48] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 3 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 216 places in 578 ms of which 18 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 2.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 (/ 1.0 3.0))
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 7.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 (/ 1.0 3.0))
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 9.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 (/ 1.0 3.0))
(s510 0.0)
(s511 0.0)
(s512 3.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 53 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:13:01] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 2 ms to minimize.
[2024-06-01 15:13:03] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 3 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 310 places in 496 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 56 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 16/16 constraints]
After SMT, in 54916ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 54943ms
[2024-06-01 15:13:10] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:13:10] [INFO ] Invariant cache hit.
[2024-06-01 15:13:10] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-06-01 15:13:10] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:13:10] [INFO ] Invariant cache hit.
[2024-06-01 15:13:12] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:13:33] [INFO ] Implicit Places using invariants and state equation in 22524 ms returned []
Implicit Place search using SMT with State Equation took 23361 ms to find 0 implicit places.
[2024-06-01 15:13:33] [INFO ] Redundant transitions in 111 ms returned []
Running 2044 sub problems to find dead transitions.
[2024-06-01 15:13:33] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:13:33] [INFO ] Invariant cache hit.
[2024-06-01 15:13:33] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:14:03] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:14:04] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:14:06] [INFO ] Deduced a trap composed of 232 places in 505 ms of which 8 ms to minimize.
[2024-06-01 15:14:06] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 3 ms to minimize.
[2024-06-01 15:14:07] [INFO ] Deduced a trap composed of 216 places in 482 ms of which 5 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 3 ms to minimize.
[2024-06-01 15:14:11] [INFO ] Deduced a trap composed of 262 places in 528 ms of which 5 ms to minimize.
[2024-06-01 15:14:17] [INFO ] Deduced a trap composed of 113 places in 427 ms of which 4 ms to minimize.
[2024-06-01 15:14:17] [INFO ] Deduced a trap composed of 310 places in 450 ms of which 4 ms to minimize.
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 576/2588 variables, and 57 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 252 places in 553 ms of which 5 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 23 places in 531 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 59 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 19/19 constraints]
After SMT, in 74879ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 74897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/836 places, 2048/2304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153558 ms. Remains : 580/836 places, 2048/2304 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 253 steps (0 resets) in 11 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:14:48] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:14:48] [INFO ] Invariant cache hit.
[2024-06-01 15:14:49] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 15:14:49] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 113 ms returned sat
[2024-06-01 15:14:52] [INFO ] [Real]Absence check using state equation in 2717 ms returned sat
[2024-06-01 15:14:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:14:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 15:14:53] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 263 ms returned sat
[2024-06-01 15:15:00] [INFO ] [Nat]Absence check using state equation in 6564 ms returned sat
[2024-06-01 15:15:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:15:01] [INFO ] [Nat]Added 200 Read/Feed constraints in 1028 ms returned sat
[2024-06-01 15:15:02] [INFO ] Deduced a trap composed of 43 places in 520 ms of which 4 ms to minimize.
[2024-06-01 15:15:03] [INFO ] Deduced a trap composed of 48 places in 604 ms of which 5 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 23 places in 525 ms of which 5 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 49 places in 573 ms of which 4 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 48 places in 535 ms of which 4 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 39 places in 551 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 15:15:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1688 reset in 919 ms.
Product exploration explored 100000 steps with 1693 reset in 727 ms.
Support contains 10 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 2048/2048 transitions.
Applied a total of 0 rules in 33 ms. Remains 580 /580 variables (removed 0) and now considering 2048/2048 (removed 0) transitions.
Running 2044 sub problems to find dead transitions.
[2024-06-01 15:15:09] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:15:09] [INFO ] Invariant cache hit.
[2024-06-01 15:15:09] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 232 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 3 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 216 places in 490 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 53 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:15:54] [INFO ] Deduced a trap composed of 45 places in 329 ms of which 4 ms to minimize.
[2024-06-01 15:15:57] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 55 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 15/15 constraints]
After SMT, in 54618ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 54636ms
[2024-06-01 15:16:04] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:16:04] [INFO ] Invariant cache hit.
[2024-06-01 15:16:05] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-06-01 15:16:05] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:16:05] [INFO ] Invariant cache hit.
[2024-06-01 15:16:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:16:32] [INFO ] Implicit Places using invariants and state equation in 27388 ms returned []
Implicit Place search using SMT with State Equation took 28210 ms to find 0 implicit places.
[2024-06-01 15:16:32] [INFO ] Redundant transitions in 75 ms returned []
Running 2044 sub problems to find dead transitions.
[2024-06-01 15:16:32] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:16:32] [INFO ] Invariant cache hit.
[2024-06-01 15:16:32] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:17:04] [INFO ] Deduced a trap composed of 232 places in 463 ms of which 4 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 2 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 216 places in 461 ms of which 4 ms to minimize.
[2024-06-01 15:17:07] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 262 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:17:14] [INFO ] Deduced a trap composed of 113 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:17:15] [INFO ] Deduced a trap composed of 310 places in 473 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 57 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 252 places in 390 ms of which 4 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 59 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 19/19 constraints]
After SMT, in 75494ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 75525ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 158505 ms. Remains : 580/580 places, 2048/2048 transitions.
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-02 finished in 388573 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(((G(p1)||p0) U p2))))'
Support contains 31 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 858 transition count 2254
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 788 transition count 2244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 778 transition count 2244
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 160 place count 778 transition count 2144
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 360 place count 678 transition count 2144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 365 place count 673 transition count 2139
Iterating global reduction 3 with 5 rules applied. Total rules applied 370 place count 673 transition count 2139
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 570 place count 573 transition count 2039
Applied a total of 570 rules in 208 ms. Remains 573 /858 variables (removed 285) and now considering 2039/2324 (removed 285) transitions.
Running 2035 sub problems to find dead transitions.
[2024-06-01 15:17:48] [INFO ] Flow matrix only has 1999 transitions (discarded 40 similar events)
// Phase 1: matrix 1999 rows 573 cols
[2024-06-01 15:17:48] [INFO ] Computed 46 invariants in 44 ms
[2024-06-01 15:17:48] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
[2024-06-01 15:18:20] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/2572 variables, and 32 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 22/36 constraints, State Equation: 0/573 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2035/2035 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/569 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/2572 variables, and 32 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 22/36 constraints, State Equation: 0/573 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2035 constraints, Known Traps: 1/1 constraints]
After SMT, in 56059ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 56089ms
[2024-06-01 15:18:44] [INFO ] Flow matrix only has 1999 transitions (discarded 40 similar events)
[2024-06-01 15:18:44] [INFO ] Invariant cache hit.
[2024-06-01 15:18:45] [INFO ] Implicit Places using invariants in 759 ms returned [474, 567]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 765 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/858 places, 2039/2324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 2038
Applied a total of 2 rules in 44 ms. Remains 570 /571 variables (removed 1) and now considering 2038/2039 (removed 1) transitions.
[2024-06-01 15:18:45] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
// Phase 1: matrix 1998 rows 570 cols
[2024-06-01 15:18:45] [INFO ] Computed 44 invariants in 36 ms
[2024-06-01 15:18:46] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-06-01 15:18:46] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
[2024-06-01 15:18:46] [INFO ] Invariant cache hit.
[2024-06-01 15:18:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:19:08] [INFO ] Implicit Places using invariants and state equation in 22611 ms returned []
Implicit Place search using SMT with State Equation took 23492 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/858 places, 2038/2324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80609 ms. Remains : 570/858 places, 2038/2324 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-03
Stuttering criterion allowed to conclude after 6488 steps with 0 reset in 252 ms.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-03 finished in 81149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 51 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 71 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:19:09] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-06-01 15:19:09] [INFO ] Computed 46 invariants in 83 ms
[2024-06-01 15:19:09] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 35211ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35237ms
[2024-06-01 15:19:44] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:19:44] [INFO ] Invariant cache hit.
[2024-06-01 15:19:45] [INFO ] Implicit Places using invariants in 774 ms returned [704, 828]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 784 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/858 places, 2304/2324 transitions.
Applied a total of 0 rules in 14 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36113 ms. Remains : 836/858 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-05 finished in 36208 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)&&F((p2||X(p3)))))'
Support contains 82 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Applied a total of 0 rules in 13 ms. Remains 858 /858 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 15:19:45] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 858 cols
[2024-06-01 15:19:45] [INFO ] Computed 46 invariants in 65 ms
[2024-06-01 15:19:45] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 9.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 9.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/854 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 34560ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 34582ms
[2024-06-01 15:20:20] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:20:20] [INFO ] Invariant cache hit.
[2024-06-01 15:20:21] [INFO ] Implicit Places using invariants in 889 ms returned [719, 847]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 898 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 856/858 places, 2324/2324 transitions.
Applied a total of 0 rules in 15 ms. Remains 856 /856 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35514 ms. Remains : 856/858 places, 2324/2324 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-07
Product exploration explored 100000 steps with 3191 reset in 746 ms.
Product exploration explored 100000 steps with 3204 reset in 701 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) (NOT p0) p2 (NOT p3)), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 40002 steps (8 resets) in 661 ms. (60 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 687 ms. (58 steps per ms) remains 1/1 properties
[2024-06-01 15:20:23] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 856 cols
[2024-06-01 15:20:23] [INFO ] Computed 44 invariants in 49 ms
[2024-06-01 15:20:23] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 724/820 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/827 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 854/3140 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/856 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms 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) (NOT p0) p2 (NOT p3)), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 252 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 15:20:24] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:20:24] [INFO ] Invariant cache hit.
[2024-06-01 15:20:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 15:20:26] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 136 ms returned sat
[2024-06-01 15:20:29] [INFO ] [Real]Absence check using state equation in 3764 ms returned sat
[2024-06-01 15:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:20:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 15:20:31] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 88 ms returned sat
[2024-06-01 15:20:34] [INFO ] [Nat]Absence check using state equation in 3323 ms returned sat
[2024-06-01 15:20:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:20:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:20:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 2382 ms returned sat
[2024-06-01 15:20:37] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:20:40] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 3226 ms
Could not prove EG (NOT p0)
[2024-06-01 15:20:40] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:20:40] [INFO ] Invariant cache hit.
[2024-06-01 15:20:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 15:20:42] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 103 ms returned sat
[2024-06-01 15:20:45] [INFO ] [Real]Absence check using state equation in 2829 ms returned sat
[2024-06-01 15:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:20:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 15:20:47] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 202 ms returned sat
[2024-06-01 15:20:50] [INFO ] [Nat]Absence check using state equation in 3157 ms returned sat
[2024-06-01 15:20:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:20:50] [INFO ] [Nat]Added 200 Read/Feed constraints in 352 ms returned sat
[2024-06-01 15:20:51] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:20:51] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:20:51] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:20:51] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:20:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1116 ms
[2024-06-01 15:20:52] [INFO ] Computed and/alt/rep : 1350/3496/1320 causal constraints (skipped 960 transitions) in 241 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 15:21:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 61 out of 856 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 : 856/856 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 856 transition count 2254
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 786 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 786 transition count 2154
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 686 transition count 2154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 680 transition count 2148
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 680 transition count 2148
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 512 place count 600 transition count 2068
Applied a total of 512 rules in 156 ms. Remains 600 /856 variables (removed 256) and now considering 2068/2324 (removed 256) transitions.
Running 2064 sub problems to find dead transitions.
[2024-06-01 15:21:00] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
// Phase 1: matrix 2028 rows 600 cols
[2024-06-01 15:21:00] [INFO ] Computed 44 invariants in 62 ms
[2024-06-01 15:21:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
[2024-06-01 15:21:32] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
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 596/2628 variables, and 36 constraints, problems are : Problem set: 0 solved, 2064 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/600 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2064/2064 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
[2024-06-01 15:21:38] [INFO ] Deduced a trap composed of 51 places in 542 ms of which 5 ms to minimize.
[2024-06-01 15:21:38] [INFO ] Deduced a trap composed of 50 places in 548 ms of which 5 ms to minimize.
[2024-06-01 15:21:38] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 50 places in 342 ms of which 4 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 51 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:21:41] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/2628 variables, and 46 constraints, problems are : Problem set: 0 solved, 2064 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/600 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2064 constraints, Known Traps: 11/11 constraints]
After SMT, in 53543ms problems are : Problem set: 0 solved, 2064 unsolved
Search for dead transitions found 0 dead transitions in 53579ms
[2024-06-01 15:21:54] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:21:54] [INFO ] Invariant cache hit.
[2024-06-01 15:21:54] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 15:21:54] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:21:54] [INFO ] Invariant cache hit.
[2024-06-01 15:21:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:22:18] [INFO ] Implicit Places using invariants and state equation in 23885 ms returned []
Implicit Place search using SMT with State Equation took 24665 ms to find 0 implicit places.
[2024-06-01 15:22:18] [INFO ] Redundant transitions in 55 ms returned []
Running 2064 sub problems to find dead transitions.
[2024-06-01 15:22:18] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:22:18] [INFO ] Invariant cache hit.
[2024-06-01 15:22:18] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/2628 variables, and 36 constraints, problems are : Problem set: 0 solved, 2064 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/600 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2064/2064 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 50 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 51 places in 398 ms of which 3 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 50 places in 375 ms of which 3 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:23:11] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/2628 variables, and 47 constraints, problems are : Problem set: 0 solved, 2064 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/600 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2064 constraints, Known Traps: 12/12 constraints]
After SMT, in 73904ms problems are : Problem set: 0 solved, 2064 unsolved
Search for dead transitions found 0 dead transitions in 73935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 600/856 places, 2068/2324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152413 ms. Remains : 600/856 places, 2068/2324 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 184 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 40000 steps (8 resets) in 805 ms. (49 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 530 ms. (75 steps per ms) remains 1/1 properties
[2024-06-01 15:23:33] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:23:33] [INFO ] Invariant cache hit.
[2024-06-01 15:23:33] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 438/576 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/581 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 598/2628 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/600 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1397ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 361 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 15:23:36] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:23:36] [INFO ] Invariant cache hit.
[2024-06-01 15:23:37] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 15:23:37] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 131 ms returned sat
[2024-06-01 15:23:39] [INFO ] [Real]Absence check using state equation in 2096 ms returned sat
[2024-06-01 15:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 15:23:41] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 137 ms returned sat
[2024-06-01 15:23:45] [INFO ] [Nat]Absence check using state equation in 4730 ms returned sat
[2024-06-01 15:23:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:23:47] [INFO ] [Nat]Added 200 Read/Feed constraints in 1312 ms returned sat
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2024-06-01 15:23:47] [INFO ] Computed and/alt/rep : 994/2814/964 causal constraints (skipped 1060 transitions) in 162 ms.
[2024-06-01 15:23:50] [INFO ] Added : 35 causal constraints over 7 iterations in 3072 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 15:23:50] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-06-01 15:23:50] [INFO ] Invariant cache hit.
[2024-06-01 15:23:51] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 15:23:51] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 106 ms returned sat
[2024-06-01 15:23:54] [INFO ] [Real]Absence check using state equation in 2692 ms returned sat
[2024-06-01 15:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 15:23:55] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 78 ms returned sat
[2024-06-01 15:24:02] [INFO ] [Nat]Absence check using state equation in 6450 ms returned sat
[2024-06-01 15:24:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:24:03] [INFO ] [Nat]Added 200 Read/Feed constraints in 883 ms returned sat
[2024-06-01 15:24:03] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2024-06-01 15:24:03] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:24:04] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 0 ms to minimize.
[2024-06-01 15:24:05] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:24:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2891 ms
[2024-06-01 15:24:06] [INFO ] Computed and/alt/rep : 994/2814/964 causal constraints (skipped 1060 transitions) in 146 ms.
[2024-06-01 15:24:09] [INFO ] Added : 85 causal constraints over 17 iterations in 3239 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 3800 reset in 924 ms.
Product exploration explored 100000 steps with 3789 reset in 796 ms.
Support contains 61 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 2068/2068 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 600 transition count 2058
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 590 transition count 2058
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 580 transition count 2048
Applied a total of 40 rules in 64 ms. Remains 580 /600 variables (removed 20) and now considering 2048/2068 (removed 20) transitions.
Running 2044 sub problems to find dead transitions.
[2024-06-01 15:24:11] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
// Phase 1: matrix 2008 rows 580 cols
[2024-06-01 15:24:11] [INFO ] Computed 44 invariants in 42 ms
[2024-06-01 15:24:11] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:24:42] [INFO ] Deduced a trap composed of 214 places in 268 ms of which 2 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 211 places in 261 ms of which 2 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 206 places in 297 ms of which 2 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 2 ms to minimize.
[2024-06-01 15:24:44] [INFO ] Deduced a trap composed of 217 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 48 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:24:50] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:24:50] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 109 places in 316 ms of which 3 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 107 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:24:56] [INFO ] Deduced a trap composed of 197 places in 352 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 61 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 22/22 constraints]
After SMT, in 55028ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 55048ms
[2024-06-01 15:25:06] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:25:06] [INFO ] Invariant cache hit.
[2024-06-01 15:25:07] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-06-01 15:25:07] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:25:07] [INFO ] Invariant cache hit.
[2024-06-01 15:25:08] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:25:30] [INFO ] Implicit Places using invariants and state equation in 23604 ms returned []
Implicit Place search using SMT with State Equation took 24320 ms to find 0 implicit places.
[2024-06-01 15:25:30] [INFO ] Redundant transitions in 56 ms returned []
Running 2044 sub problems to find dead transitions.
[2024-06-01 15:25:30] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-06-01 15:25:30] [INFO ] Invariant cache hit.
[2024-06-01 15:25:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:26:01] [INFO ] Deduced a trap composed of 216 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:26:01] [INFO ] Deduced a trap composed of 107 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:26:02] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 2 ms to minimize.
[2024-06-01 15:26:03] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2024-06-01 15:26:04] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 1 ms to minimize.
[2024-06-01 15:26:05] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:26:08] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 1 ms to minimize.
[2024-06-01 15:26:08] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 1 ms to minimize.
[2024-06-01 15:26:08] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 3.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 2.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 2.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 2.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 2.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 6.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 48 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:26:40] [INFO ] Deduced a trap composed of 202 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:26:43] [INFO ] Deduced a trap composed of 62 places in 310 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 60 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 21/21 constraints]
After SMT, in 75295ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 75315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/600 places, 2048/2068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154822 ms. Remains : 580/600 places, 2048/2068 transitions.
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-07 finished in 420556 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(X(G((F((X(p1) U p2))&&p0)))))'
Support contains 6 out of 858 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 43 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:26:46] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-06-01 15:26:46] [INFO ] Computed 46 invariants in 70 ms
[2024-06-01 15:26:46] [INFO ] State equation strengthened by 200 read => feed constraints.
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-00
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-01
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-02
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-05
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-06
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-07
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLFireability-12
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717255858536

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-00
ltl formula formula --ltl=/tmp/2134/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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.240 user 0.310 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-01
ltl formula formula --ltl=/tmp/2134/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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.990 real 0.230 user 0.330 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-02
ltl formula formula --ltl=/tmp/2134/ltl_2_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.040 real 0.290 user 0.280 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_2_
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-03
ltl formula formula --ltl=/tmp/2134/ltl_3_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.260 real 0.250 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_3_
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5148 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~491!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2735
pnml2lts-mc( 0/ 4): unique transitions count: 7262
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2738
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2738
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2738 states 7278 transitions, fanout: 2.658
pnml2lts-mc( 0/ 4): Total exploration time 0.510 sec (0.500 sec minimum, 0.507 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5369, Transitions per second: 14271
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 47.8 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-04
ltl formula formula --ltl=/tmp/2134/ltl_4_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.060 real 0.270 user 0.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_4_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-05
ltl formula formula --ltl=/tmp/2134/ltl_5_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.240 user 0.230 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_5_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-06
ltl formula formula --ltl=/tmp/2134/ltl_6_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.270 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_6_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-07
ltl formula formula --ltl=/tmp/2134/ltl_7_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.260 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_7_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-08
ltl formula formula --ltl=/tmp/2134/ltl_8_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.670 real 0.250 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5040 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~533!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2437
pnml2lts-mc( 0/ 4): unique transitions count: 5741
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2442
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2442
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2442 states 5765 transitions, fanout: 2.361
pnml2lts-mc( 0/ 4): Total exploration time 0.350 sec (0.350 sec minimum, 0.350 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6977, Transitions per second: 16471
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 50.6 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-09
ltl formula formula --ltl=/tmp/2134/ltl_9_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.240 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5042 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~239!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 64
pnml2lts-mc( 0/ 4): unique states count: 1111
pnml2lts-mc( 0/ 4): unique transitions count: 2623
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 34
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1115
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1051
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1115 states 2643 transitions, fanout: 2.370
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.220 sec minimum, 0.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5068, Transitions per second: 12014
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 54.7 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-10
ltl formula formula --ltl=/tmp/2134/ltl_10_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.230 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 20 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5095 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~647!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2405
pnml2lts-mc( 0/ 4): unique transitions count: 5527
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2409
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2409
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2409 states 5547 transitions, fanout: 2.303
pnml2lts-mc( 0/ 4): Total exploration time 0.340 sec (0.340 sec minimum, 0.340 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7085, Transitions per second: 16315
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 50.9 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-11
ltl formula formula --ltl=/tmp/2134/ltl_11_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.260 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5038 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~351!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1825
pnml2lts-mc( 0/ 4): unique transitions count: 4585
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1832
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1832
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1832 states 4612 transitions, fanout: 2.517
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.280 sec minimum, 0.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6543, Transitions per second: 16471
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 52.2 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-12
ltl formula formula --ltl=/tmp/2134/ltl_12_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.110 real 0.280 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5038 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 ~23628 transitions
pnml2lts-mc( 1/ 4): ~4956 levels ~20000 states ~44916 transitions
pnml2lts-mc( 1/ 4): ~9868 levels ~40000 states ~87224 transitions
pnml2lts-mc( 1/ 4): ~19581 levels ~80000 states ~174052 transitions
pnml2lts-mc( 1/ 4): ~38957 levels ~160000 states ~352144 transitions
pnml2lts-mc( 1/ 4): ~77710 levels ~320000 states ~689040 transitions
pnml2lts-mc( 3/ 4): ~148507 levels ~640000 states ~1417516 transitions
pnml2lts-mc( 1/ 4): ~304544 levels ~1280000 states ~2846368 transitions
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-13
ltl formula formula --ltl=/tmp/2134/ltl_13_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.250 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5038 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~522!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2424
pnml2lts-mc( 0/ 4): unique transitions count: 5534
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2429
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2429
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2429 states 5570 transitions, fanout: 2.293
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.370 sec minimum, 0.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6565, Transitions per second: 15054
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 49.1 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-14
ltl formula formula --ltl=/tmp/2134/ltl_14_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.710 real 0.220 user 0.210 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5041 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 784.0 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLFireability-15
ltl formula formula --ltl=/tmp/2134/ltl_15_
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 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.270 user 0.340 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5044 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~538!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1875
pnml2lts-mc( 0/ 4): unique transitions count: 4818
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1879
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1879
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1879 states 4850 transitions, fanout: 2.581
pnml2lts-mc( 0/ 4): Total exploration time 0.390 sec (0.380 sec minimum, 0.385 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4818, Transitions per second: 12436
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 49.2 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.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="PolyORBLF-PT-S04J04T10"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-PT-S04J04T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446800284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;