About the Execution of ITS-Tools for DatabaseWithMutex-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.688 | 3600000.00 | 5623805.00 | 307385.10 | F?FTFFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r101-tall-167814476201076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DatabaseWithMutex-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814476201076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 78K Feb 25 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 372K Feb 25 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 742K Feb 25 13:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 42K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 157K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 718K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 206K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 840K Mar 5 18:22 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 DatabaseWithMutex-PT-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678352124133
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 08:55:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 08:55:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:55:25] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-09 08:55:25] [INFO ] Transformed 830 places.
[2023-03-09 08:55:25] [INFO ] Transformed 800 transitions.
[2023-03-09 08:55:25] [INFO ] Found NUPN structural information;
[2023-03-09 08:55:25] [INFO ] Parsed PT model containing 830 places and 800 transitions and 3800 arcs in 180 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 3 formulas.
[2023-03-09 08:55:25] [INFO ] Reduced 90 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 830 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 22 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-09 08:55:26] [INFO ] Computed 130 place invariants in 50 ms
[2023-03-09 08:55:26] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-09 08:55:26] [INFO ] Invariant cache hit.
[2023-03-09 08:55:26] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-09 08:55:26] [INFO ] Invariant cache hit.
[2023-03-09 08:55:27] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1710 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2023-03-09 08:55:28] [INFO ] Flatten gal took : 235 ms
[2023-03-09 08:55:28] [INFO ] Flatten gal took : 91 ms
[2023-03-09 08:55:28] [INFO ] Input system was already deterministic with 800 transitions.
Finished random walk after 2951 steps, including 0 resets, run visited all 22 properties in 115 ms. (steps per millisecond=25 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1 U p0))))'
Support contains 300 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 48 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-09 08:55:29] [INFO ] Invariant cache hit.
[2023-03-09 08:55:29] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-09 08:55:29] [INFO ] Invariant cache hit.
[2023-03-09 08:55:30] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2023-03-09 08:55:30] [INFO ] Invariant cache hit.
[2023-03-09 08:55:31] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2477 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (EQ s3 1) (EQ s63 1) (EQ s151 1) (EQ s315 1) (EQ s341 1) (EQ s411 1) (EQ s686 1) (EQ s694 1) (EQ s789 1) (EQ s826 1)) (AND (EQ s28 1) (EQ s29 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-00 finished in 2834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 23 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-09 08:55:32] [INFO ] Invariant cache hit.
[2023-03-09 08:55:32] [INFO ] Implicit Places using invariants in 825 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 830 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 21 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 470 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s310 1) (EQ s592 1)) (AND (EQ s189 1) (EQ s388 1)) (AND (EQ s592 1) (EQ s709 1)) (AND (EQ s51 1) (EQ s271 1)) (AND (EQ s23 1) (EQ s592 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6020 reset in 1228 ms.
Product exploration explored 100000 steps with 6017 reset in 1178 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 800 rows 730 cols
[2023-03-09 08:55:36] [INFO ] Computed 30 place invariants in 25 ms
[2023-03-09 08:55:37] [INFO ] [Real]Absence check using 21 positive place invariants in 121 ms returned sat
[2023-03-09 08:55:38] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 251 ms returned sat
[2023-03-09 08:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:51] [INFO ] [Real]Absence check using state equation in 13361 ms returned unknown
Could not prove EG (NOT p0)
Support contains 110 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 730 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 630 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 630 transition count 600
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 400 place count 530 transition count 600
Applied a total of 400 rules in 83 ms. Remains 530 /730 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 530 cols
[2023-03-09 08:55:51] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-09 08:55:52] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-09 08:55:52] [INFO ] Invariant cache hit.
[2023-03-09 08:55:55] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 3486 ms to find 0 implicit places.
[2023-03-09 08:55:55] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-09 08:55:55] [INFO ] Invariant cache hit.
[2023-03-09 08:55:55] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/730 places, 600/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4298 ms. Remains : 530/730 places, 600/800 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 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-09 08:55:56] [INFO ] Invariant cache hit.
[2023-03-09 08:55:57] [INFO ] [Real]Absence check using 23 positive place invariants in 111 ms returned sat
[2023-03-09 08:55:57] [INFO ] [Real]Absence check using 23 positive and 7 generalized place invariants in 207 ms returned sat
[2023-03-09 08:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:07] [INFO ] [Real]Absence check using state equation in 9559 ms returned sat
[2023-03-09 08:56:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 90 ms returned sat
[2023-03-09 08:56:08] [INFO ] [Nat]Absence check using 23 positive and 7 generalized place invariants in 254 ms returned sat
[2023-03-09 08:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:15] [INFO ] [Nat]Absence check using state equation in 6538 ms returned sat
[2023-03-09 08:56:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 3 ms to minimize.
[2023-03-09 08:56:15] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-09 08:56:15] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-09 08:56:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-09 08:56:15] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-09 08:56:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1659 ms
[2023-03-09 08:56:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1659 ms
[2023-03-09 08:56:16] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-09 08:56:21] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-09 08:56:21] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-09 08:56:21] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-09 08:56:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-09 08:56:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-09 08:56:22] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1207 ms
[2023-03-09 08:56:22] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:56:22] [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 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8195 reset in 1228 ms.
Product exploration explored 100000 steps with 8202 reset in 1223 ms.
Built C files in :
/tmp/ltsmin15355245110598095707
[2023-03-09 08:56:24] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2023-03-09 08:56:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:56:24] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2023-03-09 08:56:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:56:25] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2023-03-09 08:56:25] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:56:25] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15355245110598095707
Running compilation step : cd /tmp/ltsmin15355245110598095707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1521 ms.
Running link step : cd /tmp/ltsmin15355245110598095707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15355245110598095707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3198595114196307405.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 28 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-09 08:56:40] [INFO ] Invariant cache hit.
[2023-03-09 08:56:40] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-09 08:56:40] [INFO ] Invariant cache hit.
[2023-03-09 08:56:43] [INFO ] Implicit Places using invariants and state equation in 3252 ms returned []
Implicit Place search using SMT with State Equation took 3856 ms to find 0 implicit places.
[2023-03-09 08:56:43] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 08:56:43] [INFO ] Invariant cache hit.
[2023-03-09 08:56:44] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4576 ms. Remains : 530/530 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin2448241011329308705
[2023-03-09 08:56:44] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2023-03-09 08:56:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:56:44] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2023-03-09 08:56:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:56:44] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2023-03-09 08:56:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:56:44] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2448241011329308705
Running compilation step : cd /tmp/ltsmin2448241011329308705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1533 ms.
Running link step : cd /tmp/ltsmin2448241011329308705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2448241011329308705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8961539836162442234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 08:56:59] [INFO ] Flatten gal took : 36 ms
[2023-03-09 08:56:59] [INFO ] Flatten gal took : 31 ms
[2023-03-09 08:56:59] [INFO ] Time to serialize gal into /tmp/LTL14214245954096397755.gal : 8 ms
[2023-03-09 08:56:59] [INFO ] Time to serialize properties into /tmp/LTL14188300498619414731.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14214245954096397755.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6773399973369310718.hoa' '-atoms' '/tmp/LTL14188300498619414731.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14188300498619414731.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6773399973369310718.hoa
Detected timeout of ITS tools.
[2023-03-09 08:57:14] [INFO ] Flatten gal took : 28 ms
[2023-03-09 08:57:14] [INFO ] Flatten gal took : 31 ms
[2023-03-09 08:57:14] [INFO ] Time to serialize gal into /tmp/LTL6064891934304873604.gal : 5 ms
[2023-03-09 08:57:14] [INFO ] Time to serialize properties into /tmp/LTL14344376584285759249.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6064891934304873604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14344376584285759249.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((RecBuff_3_5==1)&&(all_passive_3==1))||((all_passive_7==1)&&(RecBuff_7_1==1)))||(((all_passive_3==1)&&(RecBuff_3_10==1...4260
Formula 0 simplified : XG!"(((((((((RecBuff_3_5==1)&&(all_passive_3==1))||((all_passive_7==1)&&(RecBuff_7_1==1)))||(((all_passive_3==1)&&(RecBuff_3_10==1))...4254
Detected timeout of ITS tools.
[2023-03-09 08:57:30] [INFO ] Flatten gal took : 29 ms
[2023-03-09 08:57:30] [INFO ] Applying decomposition
[2023-03-09 08:57:30] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13044505575762309290.txt' '-o' '/tmp/graph13044505575762309290.bin' '-w' '/tmp/graph13044505575762309290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13044505575762309290.bin' '-l' '-1' '-v' '-w' '/tmp/graph13044505575762309290.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:57:30] [INFO ] Decomposing Gal with order
[2023-03-09 08:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:57:30] [INFO ] Removed a total of 980 redundant transitions.
[2023-03-09 08:57:30] [INFO ] Flatten gal took : 120 ms
[2023-03-09 08:57:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-09 08:57:30] [INFO ] Time to serialize gal into /tmp/LTL16915252721927408211.gal : 14 ms
[2023-03-09 08:57:30] [INFO ] Time to serialize properties into /tmp/LTL16465445596497197763.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16915252721927408211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16465445596497197763.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((i12.u59.RecBuff_3_5==1)&&(i23.u104.all_passive_3==1))||((i16.u36.all_passive_7==1)&&(i1.u74.RecBuff_7_1==1)))||(((i23...5869
Formula 0 simplified : XG!"(((((((((i12.u59.RecBuff_3_5==1)&&(i23.u104.all_passive_3==1))||((i16.u36.all_passive_7==1)&&(i1.u74.RecBuff_7_1==1)))||(((i23.u...5863
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6555081102489806591
[2023-03-09 08:57:45] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6555081102489806591
Running compilation step : cd /tmp/ltsmin6555081102489806591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1001 ms.
Running link step : cd /tmp/ltsmin6555081102489806591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6555081102489806591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-01 finished in 148593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 300 rules applied. Total rules applied 710 place count 520 transition count 400
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 61 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-09 08:58:00] [INFO ] Computed 120 place invariants in 10 ms
[2023-03-09 08:58:02] [INFO ] Implicit Places using invariants in 1966 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 37, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 212, 213, 214, 215, 216, 219, 220, 221, 222, 224, 226, 227, 229, 230, 231, 232, 234, 235, 236, 237, 238, 239, 240, 242, 244, 246, 248, 252, 256, 257, 258, 260, 261, 262, 264, 266, 267, 268, 271, 272, 274, 275, 276, 277, 278, 280, 281, 282, 283, 284, 286, 287, 288, 289, 290, 294, 296, 297, 298, 300, 301, 302, 305, 306, 307, 309, 310, 311, 312, 313, 316, 318]
[2023-03-09 08:58:02] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 24, 25, 26, 32, 36, 37, 39, 40, 46, 49, 50, 52, 54, 58, 61, 66, 67, 73, 74, 75, 81, 82, 86, 91, 92, 93, 96, 104, 105, 111, 113, 115, 116, 118, 120, 125, 127, 130, 132, 145, 146, 147, 153, 156, 157, 164, 165, 168, 173, 174, 178, 179, 184, 185, 188, 193, 198, 201, 202, 204, 205, 210, 212, 213, 214, 215, 216, 222, 231, 235, 238, 240, 244, 246, 256, 258, 262, 264, 272, 280, 281, 284, 286, 287, 289, 290, 294, 296, 301, 306, 309, 311, 318]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1973 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/830 places, 300/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 220 /220 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2042 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s73 1) (EQ s196 1)) (AND (EQ s1 1) (EQ s137 1)) (AND (EQ s30 1) (EQ s179 1)) (AND (EQ s4 1) (EQ s198 1)) (AND (EQ s34 1) (EQ s174 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 833 ms.
Product exploration explored 100000 steps with 50000 reset in 851 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), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-03 finished in 3891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 830 transition count 600
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 410 rules applied. Total rules applied 610 place count 620 transition count 400
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 41 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-09 08:58:04] [INFO ] Computed 120 place invariants in 9 ms
[2023-03-09 08:58:05] [INFO ] Implicit Places using invariants in 1339 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 37, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 212, 213, 214, 215, 216, 219, 220, 221, 222, 224, 226, 227, 229, 230, 231, 232, 234, 235, 236, 237, 238, 239, 240, 242, 244, 246, 248, 252, 256, 257, 258, 260, 261, 262, 264, 266, 267, 268, 271, 272, 274, 275, 276, 277, 278, 280, 281, 282, 283, 284, 286, 287, 288, 289, 290, 294, 296, 297, 298, 300, 301, 302, 305, 306, 307, 309, 310, 311, 312, 313, 316, 318]
[2023-03-09 08:58:05] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 24, 25, 26, 32, 36, 37, 39, 40, 46, 49, 50, 52, 54, 58, 61, 66, 67, 73, 74, 75, 81, 82, 86, 91, 92, 93, 96, 104, 105, 111, 113, 115, 116, 118, 120, 125, 127, 130, 132, 145, 146, 147, 153, 156, 157, 164, 165, 168, 173, 174, 178, 179, 184, 185, 188, 193, 198, 201, 202, 204, 205, 210, 212, 213, 214, 215, 216, 222, 231, 235, 238, 240, 244, 246, 256, 258, 262, 264, 272, 280, 281, 284, 286, 287, 289, 290, 294, 296, 301, 306, 309, 311, 318]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1346 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/830 places, 300/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1395 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s93 0) (EQ s51 0) (EQ s102 0) (EQ s184 0) (EQ s23 0) (EQ s9 0) (EQ s127 0) (EQ s42 0) (EQ s207 0) (EQ s7 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7650 reset in 430 ms.
Stack based approach found an accepted trace after 1846 steps with 138 reset with depth 13 and stack size 13 in 8 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-04 finished in 1888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(F(p1)&&G(p2))))))'
Support contains 400 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 700
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 730 transition count 700
Applied a total of 200 rules in 31 ms. Remains 730 /830 variables (removed 100) and now considering 700/800 (removed 100) transitions.
// Phase 1: matrix 700 rows 730 cols
[2023-03-09 08:58:06] [INFO ] Computed 130 place invariants in 13 ms
[2023-03-09 08:58:06] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-09 08:58:06] [INFO ] Invariant cache hit.
[2023-03-09 08:58:08] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2023-03-09 08:58:08] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 08:58:08] [INFO ] Invariant cache hit.
[2023-03-09 08:58:08] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/830 places, 700/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2435 ms. Remains : 730/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s459 0) (EQ s519 0) (EQ s577 0) (EQ s396 0) (EQ s523 0) (EQ s567 0) (EQ s406 0) (EQ s683 0) (EQ s181 0) (EQ s142 0) (EQ s33 0) (EQ s311 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1668 reset in 1064 ms.
Product exploration explored 100000 steps with 1698 reset in 1068 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 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 476 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Finished random walk after 206 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 625 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 400 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Applied a total of 0 rules in 18 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-09 08:58:12] [INFO ] Invariant cache hit.
[2023-03-09 08:58:13] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-09 08:58:13] [INFO ] Invariant cache hit.
[2023-03-09 08:58:14] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2023-03-09 08:58:14] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 08:58:14] [INFO ] Invariant cache hit.
[2023-03-09 08:58:15] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2264 ms. Remains : 730/730 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 133 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1655 reset in 1029 ms.
Product exploration explored 100000 steps with 1707 reset in 1065 ms.
Built C files in :
/tmp/ltsmin782895145932091850
[2023-03-09 08:58:18] [INFO ] Computing symmetric may disable matrix : 700 transitions.
[2023-03-09 08:58:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:58:18] [INFO ] Computing symmetric may enable matrix : 700 transitions.
[2023-03-09 08:58:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:58:18] [INFO ] Computing Do-Not-Accords matrix : 700 transitions.
[2023-03-09 08:58:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:58:18] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin782895145932091850
Running compilation step : cd /tmp/ltsmin782895145932091850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1997 ms.
Running link step : cd /tmp/ltsmin782895145932091850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin782895145932091850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3454486941894048857.hoa' '--buchi-type=spotba'
LTSmin run took 9940 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-05 finished in 24102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U p1) U (p0 U (X(X(G(p0))) U p2))))'
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 17 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-09 08:58:30] [INFO ] Computed 130 place invariants in 6 ms
[2023-03-09 08:58:31] [INFO ] Implicit Places using invariants in 912 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 915 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 943 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, p0, (AND p0 p2), p2, (AND p0 p2)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s126 1) (EQ s182 1) (EQ s237 1) (EQ s534 1) (EQ s471 1) (EQ s198 1) (EQ s633 1) (EQ s525 1) (EQ s635 1) (EQ s86 1) (EQ s498 1) (EQ s258 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2327 ms.
Product exploration explored 100000 steps with 33333 reset in 2410 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 p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 11 factoid took 227 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-06 finished in 6525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((p1||X(p0))))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 200 place count 730 transition count 500
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 600 place count 530 transition count 500
Applied a total of 600 rules in 51 ms. Remains 530 /830 variables (removed 300) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 530 cols
[2023-03-09 08:58:37] [INFO ] Computed 130 place invariants in 6 ms
[2023-03-09 08:58:37] [INFO ] Implicit Places using invariants in 700 ms returned [13, 22, 29, 30, 40, 41, 47, 49, 63, 69, 72, 75, 88, 94, 95, 103, 120, 122, 139, 140, 142, 151, 157, 158, 162, 163, 166, 167, 174, 176, 181, 195, 199, 212, 214, 216, 223, 226, 231, 232, 245, 254, 262, 266, 267, 268, 277, 281, 285, 289, 290, 300, 302, 303, 312, 316, 320, 323, 345, 361, 362, 364, 368, 372, 373, 375, 377, 381, 384, 387, 388, 391, 396, 405, 415, 426, 429, 430, 441, 442, 443, 448, 455, 456, 457, 458, 459, 465, 466, 475, 487, 490, 493, 495, 501, 504, 510, 513, 515, 521]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 702 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/830 places, 500/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 765 ms. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s72 0) (EQ s345 0) (EQ s107 0) (EQ s6 0) (EQ s403 0) (EQ s285 0) (EQ s380 0) (EQ s247 0) (EQ s154 0) (EQ s86 0) (EQ s128 0) (EQ s92 0) (EQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2115 reset in 842 ms.
Product exploration explored 100000 steps with 2135 reset in 857 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 210 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 430 cols
[2023-03-09 08:58:40] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-09 08:58:40] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-09 08:58:40] [INFO ] Invariant cache hit.
[2023-03-09 08:58:41] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2023-03-09 08:58:41] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 08:58:41] [INFO ] Invariant cache hit.
[2023-03-09 08:58:42] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1965 ms. Remains : 430/430 places, 500/500 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 2075 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2109 reset in 832 ms.
Product exploration explored 100000 steps with 2142 reset in 866 ms.
Built C files in :
/tmp/ltsmin12472891620879522252
[2023-03-09 08:58:46] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2023-03-09 08:58:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:58:46] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2023-03-09 08:58:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:58:46] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2023-03-09 08:58:46] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 08:58:46] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12472891620879522252
Running compilation step : cd /tmp/ltsmin12472891620879522252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1206 ms.
Running link step : cd /tmp/ltsmin12472891620879522252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12472891620879522252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13748217082158441830.hoa' '--buchi-type=spotba'
LTSmin run took 3560 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-07 finished in 14206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 20 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-09 08:58:51] [INFO ] Computed 130 place invariants in 5 ms
[2023-03-09 08:58:52] [INFO ] Implicit Places using invariants in 1026 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1030 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1062 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s438 1), p1:(AND (EQ s139 1) (EQ s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 500 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 p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :1
Finished Best-First random walk after 1561 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=390 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 800 rows 730 cols
[2023-03-09 08:58:54] [INFO ] Computed 30 place invariants in 13 ms
[2023-03-09 08:58:54] [INFO ] [Real]Absence check using 21 positive place invariants in 40 ms returned sat
[2023-03-09 08:58:55] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 422 ms returned sat
[2023-03-09 08:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:59:01] [INFO ] [Real]Absence check using state equation in 6166 ms returned sat
[2023-03-09 08:59:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:59:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 57 ms returned sat
[2023-03-09 08:59:02] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 268 ms returned sat
[2023-03-09 08:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:59:05] [INFO ] [Nat]Absence check using state equation in 2747 ms returned sat
[2023-03-09 08:59:05] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2023-03-09 08:59:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2023-03-09 08:59:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2023-03-09 08:59:05] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-09 08:59:13] [INFO ] Added : 414 causal constraints over 83 iterations in 8145 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-09 08:59:13] [INFO ] Invariant cache hit.
[2023-03-09 08:59:14] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-09 08:59:14] [INFO ] Invariant cache hit.
[2023-03-09 08:59:23] [INFO ] Implicit Places using invariants and state equation in 8314 ms returned []
Implicit Place search using SMT with State Equation took 9152 ms to find 0 implicit places.
[2023-03-09 08:59:23] [INFO ] Invariant cache hit.
[2023-03-09 08:59:24] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10543 ms. Remains : 730/730 places, 800/800 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 p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 916 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-09 08:59:25] [INFO ] Invariant cache hit.
[2023-03-09 08:59:25] [INFO ] [Real]Absence check using 21 positive place invariants in 55 ms returned sat
[2023-03-09 08:59:25] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 110 ms returned sat
[2023-03-09 08:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:59:34] [INFO ] [Real]Absence check using state equation in 8617 ms returned sat
[2023-03-09 08:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:59:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 39 ms returned sat
[2023-03-09 08:59:35] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 264 ms returned sat
[2023-03-09 08:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:59:40] [INFO ] [Nat]Absence check using state equation in 4964 ms returned sat
[2023-03-09 08:59:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-09 08:59:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2023-03-09 08:59:40] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2023-03-09 08:59:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-09 08:59:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2023-03-09 08:59:41] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2023-03-09 08:59:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2023-03-09 08:59:41] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-09 08:59:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-09 08:59:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2023-03-09 08:59:42] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2023-03-09 08:59:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2174 ms
[2023-03-09 08:59:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2174 ms
[2023-03-09 08:59:42] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-09 08:59:46] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-03-09 08:59:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2023-03-09 08:59:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2023-03-09 08:59:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 4 ms to minimize.
[2023-03-09 08:59:48] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2023-03-09 08:59:48] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2023-03-09 08:59:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2023-03-09 08:59:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2088 ms
[2023-03-09 08:59:48] [INFO ] Added : 279 causal constraints over 56 iterations in 6595 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 393 ms.
Product exploration explored 100000 steps with 0 reset in 486 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 730 transition count 800
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 99 Pre rules applied. Total rules applied 190 place count 730 transition count 800
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 289 place count 730 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 389 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 389 place count 730 transition count 800
Deduced a syphon composed of 389 places in 1 ms
Applied a total of 389 rules in 173 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-09 08:59:50] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2023-03-09 08:59:50] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-09 08:59:51] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/730 places, 800/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1260 ms. Remains : 730/730 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin15333667779096534358
[2023-03-09 08:59:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15333667779096534358
Running compilation step : cd /tmp/ltsmin15333667779096534358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1514 ms.
Running link step : cd /tmp/ltsmin15333667779096534358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15333667779096534358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4271643042984409953.hoa' '--buchi-type=spotba'
LTSmin run took 558 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-08 finished in 62479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 25 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-09 08:59:53] [INFO ] Computed 130 place invariants in 12 ms
[2023-03-09 08:59:54] [INFO ] Implicit Places using invariants in 1037 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1043 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1084 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s51 1) (EQ s54 1) (OR (EQ s364 0) (EQ s453 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-10 finished in 1184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 12 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 830 transition count 611
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 1 with 370 rules applied. Total rules applied 559 place count 632 transition count 439
Reduce places removed 172 places and 0 transitions.
Iterating post reduction 2 with 172 rules applied. Total rules applied 731 place count 460 transition count 439
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 731 place count 460 transition count 331
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 947 place count 352 transition count 331
Applied a total of 947 rules in 35 ms. Remains 352 /830 variables (removed 478) and now considering 331/800 (removed 469) transitions.
// Phase 1: matrix 331 rows 352 cols
[2023-03-09 08:59:55] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-09 08:59:56] [INFO ] Implicit Places using invariants in 1234 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 20, 24, 26, 29, 31, 33, 35, 39, 40, 41, 42, 43, 45, 47, 49, 50, 52, 54, 56, 57, 59, 60, 61, 66, 67, 71, 72, 76, 77, 78, 80, 81, 88, 89, 90, 91, 92, 93, 97, 99, 101, 102, 103, 104, 105, 106, 109, 110, 112, 113, 115, 116, 119, 120, 123, 124, 126, 127, 128, 129, 134, 136, 137, 138, 139, 140, 144, 147, 151, 152, 159, 160, 164, 167, 169, 170, 171, 173, 176, 177, 178, 180, 185, 187, 189, 190, 191, 192, 194, 196, 197, 199, 200, 201, 202, 203, 205, 208, 211, 212, 215, 217, 221, 222, 224, 229, 230, 232, 234, 235, 236, 241, 242, 243, 245, 247, 248, 250, 251, 252, 253, 255, 256, 257, 258, 260, 261, 264, 266, 270, 276, 281, 282, 283, 286, 287, 289, 291, 293, 294, 295, 298, 299, 301, 302, 303, 304, 305, 307, 309, 310, 311, 313, 314, 315, 316, 317, 322, 324, 325, 326, 328, 329, 330, 333, 335, 336, 339, 342, 343, 346, 349]
[2023-03-09 08:59:56] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 20, 29, 35, 39, 40, 42, 43, 49, 52, 54, 57, 59, 66, 71, 72, 78, 80, 81, 88, 89, 93, 99, 101, 104, 112, 113, 119, 123, 124, 126, 128, 134, 136, 139, 159, 160, 167, 170, 171, 180, 190, 191, 196, 197, 202, 203, 211, 217, 221, 222, 224, 230, 232, 234, 235, 236, 243, 252, 256, 261, 266, 281, 283, 289, 291, 299, 307, 311, 313, 314, 316, 317, 322, 324, 329, 335, 349, 7, 10, 16, 17, 24, 26, 31, 33, 45, 47, 50, 56, 60, 61, 67, 76, 77, 90, 91, 92, 97, 102, 103, 106, 109, 110, 116, 120, 127, 129, 137, 140, 144, 147, 151, 152, 164, 169, 173, 176, 177, 178, 185, 187, 189, 192, 194, 200, 201, 205, 208, 212, 215, 229, 241, 245, 247, 248, 250, 251, 253, 255, 257, 258, 260, 270, 276, 282, 286, 287, 293, 294, 295, 301, 302, 303, 304, 305, 309, 310, 315, 325, 328, 330, 333, 336, 339, 342, 343, 346]
Discarding 172 places :
Implicit Place search using SMT only with invariants took 1237 ms to find 172 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/830 places, 331/800 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 180 transition count 322
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 171 transition count 322
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 83 place count 106 transition count 257
Iterating global reduction 2 with 65 rules applied. Total rules applied 148 place count 106 transition count 257
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 166 place count 97 transition count 248
Applied a total of 166 rules in 15 ms. Remains 97 /180 variables (removed 83) and now considering 248/331 (removed 83) transitions.
// Phase 1: matrix 248 rows 97 cols
[2023-03-09 08:59:56] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 08:59:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 08:59:56] [INFO ] Invariant cache hit.
[2023-03-09 08:59:56] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/830 places, 248/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1429 ms. Remains : 97/830 places, 248/800 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s43 0)), p1:(AND (EQ s13 1) (EQ s36 1) (EQ s50 1) (EQ s59 1) (EQ s69 1) (EQ s70 1) (EQ s78 1) (EQ s80 1) (EQ s87 1) (EQ s94 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Stack based approach found an accepted trace after 902 steps with 0 reset with depth 903 and stack size 898 in 4 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-11 finished in 1884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 830 transition count 601
Reduce places removed 208 places and 0 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 1 with 388 rules applied. Total rules applied 587 place count 622 transition count 421
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 767 place count 442 transition count 421
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 767 place count 442 transition count 311
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 987 place count 332 transition count 311
Applied a total of 987 rules in 35 ms. Remains 332 /830 variables (removed 498) and now considering 311/800 (removed 489) transitions.
// Phase 1: matrix 311 rows 332 cols
[2023-03-09 08:59:56] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-09 08:59:58] [INFO ] Implicit Places using invariants in 1270 ms returned [0, 4, 7, 10, 12, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 37, 38, 39, 40, 41, 43, 45, 47, 48, 51, 52, 53, 56, 58, 59, 61, 64, 66, 70, 71, 75, 76, 77, 78, 79, 85, 86, 87, 88, 89, 90, 94, 95, 96, 97, 98, 99, 100, 101, 102, 105, 106, 108, 111, 112, 116, 117, 120, 121, 123, 124, 126, 130, 133, 134, 135, 137, 138, 141, 142, 146, 147, 151, 152, 153, 156, 159, 162, 163, 164, 166, 167, 168, 169, 171, 172, 175, 176, 177, 179, 180, 181, 182, 183, 185, 186, 188, 189, 190, 192, 194, 195, 197, 200, 201, 203, 206, 209, 210, 212, 213, 217, 219, 221, 222, 223, 224, 225, 228, 229, 230, 233, 235, 236, 238, 239, 240, 241, 243, 244, 245, 246, 247, 248, 249, 251, 253, 255, 257, 261, 266, 267, 268, 270, 271, 273, 275, 277, 278, 279, 282, 285, 286, 287, 288, 289, 291, 292, 293, 294, 295, 297, 298, 299, 300, 305, 307, 309, 310, 312, 313, 314, 317, 318, 319, 321, 322, 323, 324, 325, 328, 330]
[2023-03-09 08:59:58] [INFO ] Actually due to overlaps returned [0, 4, 12, 14, 18, 19, 24, 25, 26, 32, 37, 38, 40, 41, 47, 51, 52, 56, 61, 64, 70, 71, 77, 78, 79, 85, 86, 90, 95, 96, 97, 100, 108, 117, 120, 121, 123, 130, 133, 138, 151, 152, 153, 159, 163, 164, 171, 172, 175, 180, 181, 185, 186, 192, 195, 200, 206, 209, 210, 212, 213, 219, 221, 222, 223, 224, 225, 240, 244, 247, 249, 253, 255, 266, 268, 273, 275, 291, 292, 295, 297, 298, 300, 305, 307, 313, 318, 321, 323, 330, 7, 10, 16, 17, 22, 23, 28, 30, 39, 43, 45, 48, 53, 58, 59, 66, 76, 87, 88, 89, 94, 99, 101, 102, 105, 106, 111, 112, 116, 126, 134, 135, 137, 141, 142, 146, 147, 156, 162, 166, 167, 169, 176, 177, 179, 182, 183, 188, 189, 190, 194, 197, 203, 217, 229, 230, 233, 236, 238, 239, 241, 243, 245, 246, 248, 251, 257, 261, 267, 270, 271, 277, 278, 279, 282, 285, 287, 288, 293, 299, 309, 310, 312, 314, 317, 319, 322, 324, 325, 328]
Discarding 180 places :
Implicit Place search using SMT only with invariants took 1279 ms to find 180 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/830 places, 311/800 transitions.
Drop transitions 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 152 transition count 301
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 142 transition count 301
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 92 place count 70 transition count 229
Iterating global reduction 2 with 72 rules applied. Total rules applied 164 place count 70 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 69 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 69 transition count 219
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 176 place count 69 transition count 209
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 196 place count 59 transition count 199
Applied a total of 196 rules in 10 ms. Remains 59 /152 variables (removed 93) and now considering 199/311 (removed 112) transitions.
// Phase 1: matrix 199 rows 59 cols
[2023-03-09 08:59:58] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 08:59:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 08:59:58] [INFO ] Invariant cache hit.
[2023-03-09 08:59:58] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/830 places, 199/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1440 ms. Remains : 59/830 places, 199/800 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Stack based approach found an accepted trace after 1605 steps with 0 reset with depth 1606 and stack size 890 in 7 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-13 finished in 1779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 23 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-09 08:59:58] [INFO ] Computed 130 place invariants in 18 ms
[2023-03-09 08:59:59] [INFO ] Implicit Places using invariants in 1062 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1103 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s487 1) (EQ s637 1)), p2:(AND (NOT (AND (EQ s487 1) (EQ s637 1))) (NOT (AND (EQ s579 1) (EQ s655 1)))), p1:(AND (EQ s579 1) (EQ s655 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-14 finished in 1232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 11 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 830 transition count 602
Reduce places removed 208 places and 0 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 399 rules applied. Total rules applied 597 place count 622 transition count 411
Reduce places removed 191 places and 0 transitions.
Iterating post reduction 2 with 191 rules applied. Total rules applied 788 place count 431 transition count 411
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 788 place count 431 transition count 311
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 988 place count 331 transition count 311
Applied a total of 988 rules in 26 ms. Remains 331 /830 variables (removed 499) and now considering 311/800 (removed 489) transitions.
// Phase 1: matrix 311 rows 331 cols
[2023-03-09 08:59:59] [INFO ] Computed 120 place invariants in 6 ms
[2023-03-09 09:00:01] [INFO ] Implicit Places using invariants in 1366 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 19, 22, 23, 24, 25, 26, 28, 30, 32, 37, 38, 39, 40, 41, 43, 45, 47, 48, 50, 51, 52, 53, 56, 57, 59, 62, 64, 68, 73, 74, 75, 76, 77, 83, 84, 85, 86, 87, 88, 92, 94, 95, 97, 98, 99, 100, 103, 104, 106, 107, 109, 110, 113, 114, 115, 117, 118, 120, 121, 122, 123, 127, 131, 132, 133, 134, 135, 136, 139, 141, 145, 146, 150, 151, 152, 155, 158, 160, 162, 164, 165, 166, 167, 170, 171, 174, 175, 176, 178, 179, 180, 181, 182, 185, 187, 188, 189, 190, 191, 193, 194, 196, 199, 200, 202, 207, 208, 210, 211, 215, 216, 218, 219, 220, 221, 222, 225, 226, 227, 228, 230, 232, 233, 235, 236, 237, 238, 240, 241, 242, 243, 244, 246, 247, 249, 253, 255, 259, 263, 264, 265, 267, 268, 269, 271, 273, 274, 275, 278, 279, 281, 282, 284, 285, 286, 288, 289, 290, 291, 292, 294, 296, 297, 298, 302, 304, 305, 307, 309, 310, 311, 315, 316, 317, 320, 321, 322, 323, 324, 327, 329]
[2023-03-09 09:00:01] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 19, 24, 25, 26, 32, 37, 38, 40, 41, 47, 50, 51, 53, 59, 62, 68, 75, 76, 77, 83, 84, 88, 94, 95, 98, 106, 107, 113, 115, 117, 118, 120, 122, 127, 131, 134, 136, 150, 151, 152, 158, 162, 170, 171, 174, 179, 180, 185, 190, 191, 194, 199, 207, 208, 210, 211, 216, 218, 219, 220, 221, 222, 228, 237, 241, 244, 247, 253, 263, 265, 269, 271, 279, 288, 289, 292, 294, 297, 298, 302, 304, 310, 316, 320, 322, 329, 23, 97, 133, 135, 189, 215, 236, 267, 315]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1370 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/830 places, 311/800 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 231 transition count 222
Reduce places removed 97 places and 0 transitions.
Graph (trivial) has 180 edges and 134 vertex of which 90 / 134 are part of one of the 10 SCC in 3 ms
Free SCC test removed 80 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 188 place count 54 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 151 rules applied. Total rules applied 339 place count 53 transition count 71
Applied a total of 339 rules in 8 ms. Remains 53 /231 variables (removed 178) and now considering 71/311 (removed 240) transitions.
[2023-03-09 09:00:01] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 53 cols
[2023-03-09 09:00:01] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 09:00:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 09:00:01] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-09 09:00:01] [INFO ] Invariant cache hit.
[2023-03-09 09:00:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/830 places, 71/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1490 ms. Remains : 53/830 places, 71/800 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s16 1), p1:(OR (EQ s4 0) (EQ s8 0) (EQ s12 0) (EQ s15 0) (EQ s17 0) (EQ s23 0) (EQ s31 0) (EQ s39 0) (EQ s43 0) (EQ s47 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-15 finished in 1627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : DatabaseWithMutex-PT-10-LTLFireability-01
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 730 transition count 600
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 45 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 630 cols
[2023-03-09 09:00:01] [INFO ] Computed 130 place invariants in 12 ms
[2023-03-09 09:00:02] [INFO ] Implicit Places using invariants in 711 ms returned [15, 26, 37, 38, 50, 51, 58, 61, 75, 86, 90, 93, 108, 114, 115, 124, 141, 144, 166, 167, 169, 178, 185, 186, 190, 191, 195, 197, 204, 206, 212, 228, 232, 249, 251, 253, 264, 268, 274, 277, 292, 302, 310, 316, 317, 318, 328, 333, 337, 341, 343, 354, 358, 360, 370, 374, 379, 382, 408, 427, 428, 430, 435, 439, 440, 442, 444, 448, 451, 454, 456, 460, 465, 479, 491, 504, 507, 509, 522, 523, 525, 530, 537, 538, 539, 541, 542, 552, 553, 563, 575, 578, 581, 583, 591, 594, 604, 607, 609, 620]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 716 ms to find 100 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 530/830 places, 600/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 775 ms. Remains : 530/830 places, 600/800 transitions.
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s228 1) (EQ s433 1)) (AND (EQ s141 1) (EQ s285 1)) (AND (EQ s433 1) (EQ s512 1)) (AND (EQ s37 1) (EQ s201 1)) (AND (EQ s18 1) (EQ s433 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8193 reset in 1186 ms.
Product exploration explored 100000 steps with 8205 reset in 1214 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 600 rows 530 cols
[2023-03-09 09:00:05] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-09 09:00:06] [INFO ] [Real]Absence check using 23 positive place invariants in 120 ms returned sat
[2023-03-09 09:00:06] [INFO ] [Real]Absence check using 23 positive and 7 generalized place invariants in 189 ms returned sat
[2023-03-09 09:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:00:19] [INFO ] [Real]Absence check using state equation in 12711 ms returned sat
[2023-03-09 09:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:00:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 89 ms returned sat
[2023-03-09 09:00:20] [INFO ] [Nat]Absence check using 23 positive and 7 generalized place invariants in 110 ms returned sat
[2023-03-09 09:00:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:00:30] [INFO ] [Nat]Absence check using state equation in 9529 ms returned sat
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-09 09:00:32] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-09 09:00:32] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-09 09:00:32] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-09 09:00:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2255 ms
[2023-03-09 09:00:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2255 ms
[2023-03-09 09:00:32] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-09 09:00:34] [INFO ] Added : 70 causal constraints over 14 iterations in 2025 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 14 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-09 09:00:34] [INFO ] Invariant cache hit.
[2023-03-09 09:00:35] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-09 09:00:35] [INFO ] Invariant cache hit.
[2023-03-09 09:00:38] [INFO ] Implicit Places using invariants and state equation in 3303 ms returned []
Implicit Place search using SMT with State Equation took 3934 ms to find 0 implicit places.
[2023-03-09 09:00:38] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 09:00:38] [INFO ] Invariant cache hit.
[2023-03-09 09:00:39] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4632 ms. Remains : 530/530 places, 600/600 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 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-09 09:00:39] [INFO ] Invariant cache hit.
[2023-03-09 09:00:40] [INFO ] [Real]Absence check using 23 positive place invariants in 115 ms returned sat
[2023-03-09 09:00:40] [INFO ] [Real]Absence check using 23 positive and 7 generalized place invariants in 212 ms returned sat
[2023-03-09 09:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:00:50] [INFO ] [Real]Absence check using state equation in 9643 ms returned sat
[2023-03-09 09:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:00:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 94 ms returned sat
[2023-03-09 09:00:52] [INFO ] [Nat]Absence check using 23 positive and 7 generalized place invariants in 255 ms returned sat
[2023-03-09 09:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:00:58] [INFO ] [Nat]Absence check using state equation in 6723 ms returned sat
[2023-03-09 09:00:58] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-09 09:00:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 9 ms to minimize.
[2023-03-09 09:01:00] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-09 09:01:00] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-09 09:01:00] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-09 09:01:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1567 ms
[2023-03-09 09:01:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1567 ms
[2023-03-09 09:01:00] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-09 09:01:04] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-09 09:01:04] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-09 09:01:05] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-09 09:01:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-09 09:01:05] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-09 09:01:05] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1074 ms
[2023-03-09 09:01:05] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 0 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 09:01:05] [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 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8201 reset in 1228 ms.
Product exploration explored 100000 steps with 8197 reset in 1244 ms.
Built C files in :
/tmp/ltsmin14288313259700432590
[2023-03-09 09:01:08] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2023-03-09 09:01:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:01:08] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2023-03-09 09:01:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:01:08] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2023-03-09 09:01:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:01:08] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14288313259700432590
Running compilation step : cd /tmp/ltsmin14288313259700432590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1540 ms.
Running link step : cd /tmp/ltsmin14288313259700432590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14288313259700432590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11628889277178602177.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 20 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-09 09:01:23] [INFO ] Invariant cache hit.
[2023-03-09 09:01:24] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-09 09:01:24] [INFO ] Invariant cache hit.
[2023-03-09 09:01:26] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 3487 ms to find 0 implicit places.
[2023-03-09 09:01:26] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 09:01:26] [INFO ] Invariant cache hit.
[2023-03-09 09:01:27] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4192 ms. Remains : 530/530 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin18324038239350751393
[2023-03-09 09:01:27] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2023-03-09 09:01:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:01:27] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2023-03-09 09:01:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:01:27] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2023-03-09 09:01:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:01:27] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18324038239350751393
Running compilation step : cd /tmp/ltsmin18324038239350751393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1469 ms.
Running link step : cd /tmp/ltsmin18324038239350751393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin18324038239350751393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16275286977342550312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 09:01:42] [INFO ] Flatten gal took : 24 ms
[2023-03-09 09:01:42] [INFO ] Flatten gal took : 24 ms
[2023-03-09 09:01:42] [INFO ] Time to serialize gal into /tmp/LTL15567700591100659404.gal : 4 ms
[2023-03-09 09:01:42] [INFO ] Time to serialize properties into /tmp/LTL5822185674154989373.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15567700591100659404.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17681428341759003232.hoa' '-atoms' '/tmp/LTL5822185674154989373.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5822185674154989373.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17681428341759003232.hoa
Detected timeout of ITS tools.
[2023-03-09 09:01:57] [INFO ] Flatten gal took : 36 ms
[2023-03-09 09:01:57] [INFO ] Flatten gal took : 22 ms
[2023-03-09 09:01:57] [INFO ] Time to serialize gal into /tmp/LTL18424863402068058591.gal : 4 ms
[2023-03-09 09:01:57] [INFO ] Time to serialize properties into /tmp/LTL15144503696463606428.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18424863402068058591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15144503696463606428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((RecBuff_3_5==1)&&(all_passive_3==1))||((all_passive_7==1)&&(RecBuff_7_1==1)))||(((all_passive_3==1)&&(RecBuff_3_10==1...4260
Formula 0 simplified : XG!"(((((((((RecBuff_3_5==1)&&(all_passive_3==1))||((all_passive_7==1)&&(RecBuff_7_1==1)))||(((all_passive_3==1)&&(RecBuff_3_10==1))...4254
Detected timeout of ITS tools.
[2023-03-09 09:02:12] [INFO ] Flatten gal took : 23 ms
[2023-03-09 09:02:12] [INFO ] Applying decomposition
[2023-03-09 09:02:13] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6390946926479365897.txt' '-o' '/tmp/graph6390946926479365897.bin' '-w' '/tmp/graph6390946926479365897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6390946926479365897.bin' '-l' '-1' '-v' '-w' '/tmp/graph6390946926479365897.weights' '-q' '0' '-e' '0.001'
[2023-03-09 09:02:13] [INFO ] Decomposing Gal with order
[2023-03-09 09:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 09:02:13] [INFO ] Removed a total of 980 redundant transitions.
[2023-03-09 09:02:13] [INFO ] Flatten gal took : 52 ms
[2023-03-09 09:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-09 09:02:13] [INFO ] Time to serialize gal into /tmp/LTL12785505904317117123.gal : 8 ms
[2023-03-09 09:02:13] [INFO ] Time to serialize properties into /tmp/LTL5289247638802271644.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12785505904317117123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5289247638802271644.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((i8.u54.RecBuff_3_5==1)&&(i25.u101.all_passive_3==1))||((i0.u32.all_passive_7==1)&&(i1.u80.RecBuff_7_1==1)))||(((i25.u...5852
Formula 0 simplified : XG!"(((((((((i8.u54.RecBuff_3_5==1)&&(i25.u101.all_passive_3==1))||((i0.u32.all_passive_7==1)&&(i1.u80.RecBuff_7_1==1)))||(((i25.u10...5846
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2058985973294672824
[2023-03-09 09:02:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2058985973294672824
Running compilation step : cd /tmp/ltsmin2058985973294672824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1025 ms.
Running link step : cd /tmp/ltsmin2058985973294672824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2058985973294672824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-01 finished in 161878 ms.
[2023-03-09 09:02:43] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin576089335682058132
[2023-03-09 09:02:43] [INFO ] Applying decomposition
[2023-03-09 09:02:43] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2023-03-09 09:02:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:02:43] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2023-03-09 09:02:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:02:43] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2311080503838470674.txt' '-o' '/tmp/graph2311080503838470674.bin' '-w' '/tmp/graph2311080503838470674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2311080503838470674.bin' '-l' '-1' '-v' '-w' '/tmp/graph2311080503838470674.weights' '-q' '0' '-e' '0.001'
[2023-03-09 09:02:43] [INFO ] Decomposing Gal with order
[2023-03-09 09:02:43] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2023-03-09 09:02:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 09:02:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 09:02:43] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin576089335682058132
Running compilation step : cd /tmp/ltsmin576089335682058132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 09:02:43] [INFO ] Removed a total of 1690 redundant transitions.
[2023-03-09 09:02:43] [INFO ] Flatten gal took : 64 ms
[2023-03-09 09:02:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-09 09:02:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10096190314591345385.gal : 9 ms
[2023-03-09 09:02:43] [INFO ] Time to serialize properties into /tmp/LTLFireability18008049387809013605.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10096190314591345385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18008049387809013605.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((i19.u104.RecBuff_3_5==1)&&(i25.u181.all_passive_3==1))||((i1.u3.all_passive_7==1)&&(i2.u146.RecBuff_7_1==1)))||(((i25...5890
Formula 0 simplified : XG!"(((((((((i19.u104.RecBuff_3_5==1)&&(i25.u181.all_passive_3==1))||((i1.u3.all_passive_7==1)&&(i2.u146.RecBuff_7_1==1)))||(((i25.u...5884
Compilation finished in 2341 ms.
Running link step : cd /tmp/ltsmin576089335682058132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin576089335682058132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.070: LTL layer: formula: X(<>((LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.071: "X(<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.071: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.110: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.347: DFS-FIFO for weak LTL, using special progress label 802
pins2lts-mc-linux64( 0/ 8), 0.347: There are 803 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.347: State length is 831, there are 802 groups
pins2lts-mc-linux64( 0/ 8), 0.347: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.347: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.347: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.347: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.493: ~22 levels ~960 states ~6760 transitions
pins2lts-mc-linux64( 7/ 8), 0.535: ~22 levels ~1920 states ~7648 transitions
pins2lts-mc-linux64( 0/ 8), 0.600: ~24 levels ~3840 states ~9624 transitions
pins2lts-mc-linux64( 4/ 8), 0.760: ~26 levels ~7680 states ~13944 transitions
pins2lts-mc-linux64( 4/ 8), 1.043: ~26 levels ~15360 states ~21680 transitions
pins2lts-mc-linux64( 0/ 8), 1.552: ~24 levels ~30720 states ~38904 transitions
pins2lts-mc-linux64( 4/ 8), 2.395: ~26 levels ~61440 states ~72376 transitions
pins2lts-mc-linux64( 4/ 8), 4.247: ~26 levels ~122880 states ~138264 transitions
pins2lts-mc-linux64( 4/ 8), 7.885: ~26 levels ~245760 states ~280448 transitions
pins2lts-mc-linux64( 3/ 8), 14.565: ~24 levels ~491520 states ~558208 transitions
pins2lts-mc-linux64( 3/ 8), 27.613: ~26 levels ~983040 states ~1099232 transitions
pins2lts-mc-linux64( 3/ 8), 52.959: ~26 levels ~1966080 states ~2222248 transitions
pins2lts-mc-linux64( 5/ 8), 103.806: ~24 levels ~3932160 states ~4589896 transitions
pins2lts-mc-linux64( 5/ 8), 205.749: ~24 levels ~7864320 states ~9220152 transitions
pins2lts-mc-linux64( 5/ 8), 409.260: ~26 levels ~15728640 states ~18341976 transitions
pins2lts-mc-linux64( 5/ 8), 754.495: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 755.267:
pins2lts-mc-linux64( 0/ 8), 755.267: mean standard work distribution: 9.3% (states) 9.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 755.267:
pins2lts-mc-linux64( 0/ 8), 755.267: Explored 26815440 states 31300054 transitions, fanout: 1.167
pins2lts-mc-linux64( 0/ 8), 755.267: Total exploration time 754.900 sec (754.150 sec minimum, 754.444 sec on average)
pins2lts-mc-linux64( 0/ 8), 755.267: States per second: 35522, Transitions per second: 41463
pins2lts-mc-linux64( 0/ 8), 755.267:
pins2lts-mc-linux64( 0/ 8), 755.267: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 755.267: Redundant explorations: -0.0197
pins2lts-mc-linux64( 0/ 8), 755.267:
pins2lts-mc-linux64( 0/ 8), 755.267: Queue width: 8B, total height: 230, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 755.267: Tree memory: 460.6MB, 18.0 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 755.267: Tree fill ratio (roots/leafs): 19.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 755.267: Stored 902 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 755.267: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 755.267: Est. total memory use: 460.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin576089335682058132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin576089335682058132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-09 09:25:08] [INFO ] Applying decomposition
[2023-03-09 09:25:09] [INFO ] Flatten gal took : 27 ms
[2023-03-09 09:25:09] [INFO ] Decomposing Gal with order
[2023-03-09 09:25:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 09:25:09] [INFO ] Removed a total of 1690 redundant transitions.
[2023-03-09 09:25:09] [INFO ] Flatten gal took : 64 ms
[2023-03-09 09:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-09 09:25:09] [INFO ] Time to serialize gal into /tmp/LTLFireability12231753813170937582.gal : 6 ms
[2023-03-09 09:25:09] [INFO ] Time to serialize properties into /tmp/LTLFireability2455282219466781688.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12231753813170937582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2455282219466781688.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((u99.RecBuff_3_5==1)&&(u17.all_passive_3==1))||((u18.all_passive_7==1)&&(u37.RecBuff_7_1==1)))||(((u17.all_passive_3==...5081
Formula 0 simplified : XG!"(((((((((u99.RecBuff_3_5==1)&&(u17.all_passive_3==1))||((u18.all_passive_7==1)&&(u37.RecBuff_7_1==1)))||(((u17.all_passive_3==1)...5075
Detected timeout of ITS tools.
[2023-03-09 09:47:50] [INFO ] Flatten gal took : 514 ms
[2023-03-09 09:47:52] [INFO ] Input system was already deterministic with 800 transitions.
[2023-03-09 09:47:52] [INFO ] Transformed 830 places.
[2023-03-09 09:47:52] [INFO ] Transformed 800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 09:48:22] [INFO ] Time to serialize gal into /tmp/LTLFireability2126669198324700559.gal : 6 ms
[2023-03-09 09:48:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17433799289294694940.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2126669198324700559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17433799289294694940.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("(((((((((RecBuff_3_5==1)&&(all_passive_3==1))||((all_passive_7==1)&&(RecBuff_7_1==1)))||(((all_passive_3==1)&&(RecBuff_3_10==1...4260
Formula 0 simplified : XG!"(((((((((RecBuff_3_5==1)&&(all_passive_3==1))||((all_passive_7==1)&&(RecBuff_7_1==1)))||(((all_passive_3==1)&&(RecBuff_3_10==1))...4254
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5937216 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16000516 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-PT-10, 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 r101-tall-167814476201076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-10.tgz
mv DatabaseWithMutex-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;