Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662339300780.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ResAllocation-PT-R003C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339300780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 23:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 11 23:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 23:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 23:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14K 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 ResAllocation-PT-R003C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717264575148

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:56:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:56:16] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-06-01 17:56:16] [INFO ] Transformed 12 places.
[2024-06-01 17:56:16] [INFO ] Transformed 8 transitions.
[2024-06-01 17:56:16] [INFO ] Found NUPN structural information;
[2024-06-01 17:56:16] [INFO ] Parsed PT model containing 12 places and 8 transitions and 30 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R003C002-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 17:56:16] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 17:56:16] [INFO ] Implicit Places using invariants in 205 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 281 ms. Remains : 11/12 places, 8/8 transitions.
Support contains 10 out of 11 places after structural reductions.
[2024-06-01 17:56:17] [INFO ] Flatten gal took : 13 ms
[2024-06-01 17:56:17] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:56:17] [INFO ] Input system was already deterministic with 8 transitions.
Reduction of identical properties reduced properties to check from 14 to 8
RANDOM walk for 332 steps (51 resets) in 38 ms. (8 steps per ms) remains 0/8 properties
FORMULA ResAllocation-PT-R003C002-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 8 transition count 6
Applied a total of 5 rules in 11 ms. Remains 8 /11 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 17:56:17] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 17:56:17] [INFO ] Implicit Places using invariants in 28 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 6/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 7/11 places, 6/8 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-00 finished in 348 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)) U G(p1)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 7
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 17:56:18] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 17:56:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 17:56:18] [INFO ] Invariant cache hit.
[2024-06-01 17:56:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 17:56:18] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 17:56:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/16 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 22 constraints, problems are : Problem set: 0 solved, 5 unsolved in 98 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/16 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 27 constraints, problems are : Problem set: 0 solved, 5 unsolved in 80 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 9/11 places, 7/8 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), p0]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-01
Stuttering criterion allowed to conclude after 16 steps with 3 reset in 0 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-01 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Applied a total of 2 rules in 5 ms. Remains 10 /11 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 17:56:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:56:18] [INFO ] Implicit Places using invariants in 33 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 7/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 8/11 places, 7/8 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-02
Product exploration explored 100000 steps with 25856 reset in 208 ms.
Product exploration explored 100000 steps with 26059 reset in 95 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 167 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 8 cols
[2024-06-01 17:56:19] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 17:56:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 17:56:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 17:56:19] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 17:56:19] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 17:56:19] [INFO ] Invariant cache hit.
[2024-06-01 17:56:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 17:56:19] [INFO ] Invariant cache hit.
[2024-06-01 17:56:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 17:56:19] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 17:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 8/8 places, 7/7 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 181 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-06-01 17:56:20] [INFO ] Invariant cache hit.
[2024-06-01 17:56:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 17:56:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 17:56:20] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 17:56:20] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26128 reset in 122 ms.
Product exploration explored 100000 steps with 25974 reset in 53 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 17:56:20] [INFO ] Invariant cache hit.
[2024-06-01 17:56:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 17:56:20] [INFO ] Invariant cache hit.
[2024-06-01 17:56:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 17:56:20] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 17:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 8/8 places, 7/7 transitions.
Treatment of property ResAllocation-PT-R003C002-LTLFireability-02 finished in 2476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1&&X(!p0)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 17:56:20] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 17:56:20] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26 ms. Remains : 10/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR p0 p1), true, (OR p0 p1)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-03
Entered a terminal (fully accepting) state of product in 22 steps with 4 reset in 1 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-03 finished in 125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:20] [INFO ] Invariant cache hit.
[2024-06-01 17:56:21] [INFO ] Implicit Places using invariants in 41 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 9/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-05 finished in 142 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||((!p1 U (p2||G(!p1)))&&(p0||G(p3))))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:21] [INFO ] Invariant cache hit.
[2024-06-01 17:56:21] [INFO ] Implicit Places using invariants in 27 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 10/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-06 finished in 238 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&&X((p1&&F(p2))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:21] [INFO ] Invariant cache hit.
[2024-06-01 17:56:21] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 10/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-07 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:21] [INFO ] Invariant cache hit.
[2024-06-01 17:56:21] [INFO ] Implicit Places using invariants in 25 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 9/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-08
Stuttering criterion allowed to conclude after 79 steps with 28 reset in 1 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-08 finished in 100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U (p1 U p0))))||(G((X(p0) U p1)) U p1)))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:21] [INFO ] Invariant cache hit.
[2024-06-01 17:56:21] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24 ms. Remains : 10/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-10
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-10 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((G(p2)||p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:21] [INFO ] Invariant cache hit.
[2024-06-01 17:56:21] [INFO ] Implicit Places using invariants in 29 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 9/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-11 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(F((!p1 U (p2||G(!p1)))))||p0))))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:22] [INFO ] Invariant cache hit.
[2024-06-01 17:56:22] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 10/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-14
Product exploration explored 100000 steps with 24477 reset in 52 ms.
Product exploration explored 100000 steps with 24488 reset in 61 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 p0 (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (6127 resets) in 421 ms. (94 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (2856 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 10 cols
[2024-06-01 17:56:23] [INFO ] Computed 4 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/9 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/18 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 3/18 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Domain max(s): 3/10 constraints, Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:23] [INFO ] Invariant cache hit.
[2024-06-01 17:56:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 17:56:23] [INFO ] Invariant cache hit.
[2024-06-01 17:56:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-06-01 17:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:56:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 6 ms to minimize.
[2024-06-01 17:56:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 26 constraints, problems are : Problem set: 0 solved, 6 unsolved in 131 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 32 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 205ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 10/10 places, 8/8 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 p0 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 37 steps (5 resets) in 5 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24501 reset in 61 ms.
Product exploration explored 100000 steps with 24478 reset in 64 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:25] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 17:56:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:56:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:56:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 26 constraints, problems are : Problem set: 0 solved, 6 unsolved in 117 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 32 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 173ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 10/10 places, 8/8 transitions.
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:25] [INFO ] Invariant cache hit.
[2024-06-01 17:56:25] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 17:56:25] [INFO ] Invariant cache hit.
[2024-06-01 17:56:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-06-01 17:56:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:56:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:56:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 26 constraints, problems are : Problem set: 0 solved, 6 unsolved in 145 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 32 constraints, problems are : Problem set: 0 solved, 6 unsolved in 160 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 309ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 309ms
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property ResAllocation-PT-R003C002-LTLFireability-14 finished in 3815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(!p0)) U (p1&&G(F(p1)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 17:56:26] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 17:56:26] [INFO ] Implicit Places using invariants in 31 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 10/11 places, 8/8 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), p0, (NOT p1), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-15
Stuttering criterion allowed to conclude after 23 steps with 3 reset in 0 ms.
FORMULA ResAllocation-PT-R003C002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C002-LTLFireability-15 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(F((!p1 U (p2||G(!p1)))))||p0))))))'
Found a Shortening insensitive property : ResAllocation-PT-R003C002-LTLFireability-14
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:26] [INFO ] Invariant cache hit.
[2024-06-01 17:56:26] [INFO ] Implicit Places using invariants in 51 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 55 ms. Remains : 10/11 places, 8/8 transitions.
Running random walk in product with property : ResAllocation-PT-R003C002-LTLFireability-14
Product exploration explored 100000 steps with 24492 reset in 59 ms.
Product exploration explored 100000 steps with 24477 reset in 89 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 p0 (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (6131 resets) in 79 ms. (500 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (2856 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 10 cols
[2024-06-01 17:56:27] [INFO ] Computed 4 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/9 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/18 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 3/18 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Domain max(s): 3/10 constraints, Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:27] [INFO ] Invariant cache hit.
[2024-06-01 17:56:28] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 17:56:28] [INFO ] Invariant cache hit.
[2024-06-01 17:56:28] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-06-01 17:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:56:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:56:28] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 26 constraints, problems are : Problem set: 0 solved, 6 unsolved in 95 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 32 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 150ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 10/10 places, 8/8 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 p0 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 138 steps (22 resets) in 6 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24483 reset in 56 ms.
Product exploration explored 100000 steps with 24482 reset in 63 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:29] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 17:56:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:56:29] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 17:56:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 26 constraints, problems are : Problem set: 0 solved, 6 unsolved in 160 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 32 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 10/10 places, 8/8 transitions.
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 17:56:29] [INFO ] Invariant cache hit.
[2024-06-01 17:56:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 17:56:29] [INFO ] Invariant cache hit.
[2024-06-01 17:56:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-06-01 17:56:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:56:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:56:30] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 26 constraints, problems are : Problem set: 0 solved, 6 unsolved in 123 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 32 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 171ms
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property ResAllocation-PT-R003C002-LTLFireability-14 finished in 3689 ms.
[2024-06-01 17:56:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:56:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 17:56:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 8 transitions and 28 arcs took 3 ms.
Total runtime 13850 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ResAllocation-PT-R003C002-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R003C002-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717264590405

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ResAllocation-PT-R003C002-LTLFireability-02
ltl formula formula --ltl=/tmp/1486/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 11 places, 8 transitions and 28 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1486/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1486/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1486/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1486/ltl_0_
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 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 12, there are 13 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: 23
pnml2lts-mc( 0/ 4): unique states count: 37
pnml2lts-mc( 0/ 4): unique transitions count: 68
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 35
pnml2lts-mc( 0/ 4): - claim found count: 19
pnml2lts-mc( 0/ 4): - claim success count: 52
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 52 states 119 transitions, fanout: 2.288
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, 14.3 B/state, compr.: 28.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8 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 ResAllocation-PT-R003C002-LTLFireability-14
ltl formula formula --ltl=/tmp/1486/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
pnml2lts-mc( 0/ 4): Petri net has 11 places, 8 transitions and 28 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1486/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1486/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1486/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1486/ltl_1_
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 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 12, there are 23 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: 14
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 16
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 30 transitions, fanout: 1.500
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, 26.9 B/state, compr.: 53.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8 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)

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="ResAllocation-PT-R003C002"
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 ResAllocation-PT-R003C002, 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 r520-tall-171662339300780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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