About the Execution of 2023-gold for ShieldIIPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.535 | 3600000.00 | 11103452.00 | 13068.40 | F?TFT??TF?FF???F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788500098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788500098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 846K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716945745227
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 01:22:27] [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]
[2024-05-29 01:22:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:22:27] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-29 01:22:27] [INFO ] Transformed 3003 places.
[2024-05-29 01:22:27] [INFO ] Transformed 2953 transitions.
[2024-05-29 01:22:27] [INFO ] Found NUPN structural information;
[2024-05-29 01:22:27] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-050B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 344 places :
Symmetric choice reduction at 0 with 344 rule applications. Total rules 344 place count 2659 transition count 2609
Iterating global reduction 0 with 344 rules applied. Total rules applied 688 place count 2659 transition count 2609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 689 place count 2658 transition count 2608
Iterating global reduction 0 with 1 rules applied. Total rules applied 690 place count 2658 transition count 2608
Applied a total of 690 rules in 896 ms. Remains 2658 /3003 variables (removed 345) and now considering 2608/2953 (removed 345) transitions.
// Phase 1: matrix 2608 rows 2658 cols
[2024-05-29 01:22:28] [INFO ] Computed 451 invariants in 45 ms
[2024-05-29 01:22:29] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-29 01:22:29] [INFO ] Invariant cache hit.
[2024-05-29 01:22:33] [INFO ] Implicit Places using invariants and state equation in 3283 ms returned []
Implicit Place search using SMT with State Equation took 4477 ms to find 0 implicit places.
[2024-05-29 01:22:33] [INFO ] Invariant cache hit.
[2024-05-29 01:22:35] [INFO ] Dead Transitions using invariants and state equation in 2094 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2658/3003 places, 2608/2953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7470 ms. Remains : 2658/3003 places, 2608/2953 transitions.
Support contains 54 out of 2658 places after structural reductions.
[2024-05-29 01:22:35] [INFO ] Flatten gal took : 220 ms
[2024-05-29 01:22:35] [INFO ] Flatten gal took : 121 ms
[2024-05-29 01:22:36] [INFO ] Input system was already deterministic with 2608 transitions.
Support contains 52 out of 2658 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=18 ) properties (out of 33) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 01:22:36] [INFO ] Invariant cache hit.
[2024-05-29 01:22:37] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 01:22:38] [INFO ] [Nat]Absence check using 451 positive place invariants in 188 ms returned sat
[2024-05-29 01:22:40] [INFO ] After 2056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 01:22:41] [INFO ] Deduced a trap composed of 14 places in 825 ms of which 23 ms to minimize.
[2024-05-29 01:22:42] [INFO ] Deduced a trap composed of 27 places in 809 ms of which 2 ms to minimize.
[2024-05-29 01:22:43] [INFO ] Deduced a trap composed of 29 places in 727 ms of which 2 ms to minimize.
[2024-05-29 01:22:44] [INFO ] Deduced a trap composed of 41 places in 714 ms of which 5 ms to minimize.
[2024-05-29 01:22:44] [INFO ] Deduced a trap composed of 20 places in 768 ms of which 2 ms to minimize.
[2024-05-29 01:22:45] [INFO ] Deduced a trap composed of 24 places in 716 ms of which 2 ms to minimize.
[2024-05-29 01:22:46] [INFO ] Deduced a trap composed of 40 places in 754 ms of which 2 ms to minimize.
[2024-05-29 01:22:47] [INFO ] Deduced a trap composed of 23 places in 714 ms of which 1 ms to minimize.
[2024-05-29 01:22:48] [INFO ] Deduced a trap composed of 24 places in 755 ms of which 2 ms to minimize.
[2024-05-29 01:22:49] [INFO ] Deduced a trap composed of 31 places in 737 ms of which 1 ms to minimize.
[2024-05-29 01:22:49] [INFO ] Deduced a trap composed of 23 places in 757 ms of which 1 ms to minimize.
[2024-05-29 01:22:50] [INFO ] Deduced a trap composed of 27 places in 729 ms of which 1 ms to minimize.
[2024-05-29 01:22:51] [INFO ] Deduced a trap composed of 38 places in 746 ms of which 2 ms to minimize.
[2024-05-29 01:22:52] [INFO ] Deduced a trap composed of 25 places in 734 ms of which 2 ms to minimize.
[2024-05-29 01:22:53] [INFO ] Deduced a trap composed of 31 places in 719 ms of which 1 ms to minimize.
[2024-05-29 01:22:54] [INFO ] Deduced a trap composed of 19 places in 755 ms of which 2 ms to minimize.
[2024-05-29 01:22:54] [INFO ] Deduced a trap composed of 28 places in 720 ms of which 2 ms to minimize.
[2024-05-29 01:22:55] [INFO ] Deduced a trap composed of 32 places in 718 ms of which 2 ms to minimize.
[2024-05-29 01:22:56] [INFO ] Deduced a trap composed of 24 places in 720 ms of which 1 ms to minimize.
[2024-05-29 01:22:57] [INFO ] Deduced a trap composed of 30 places in 716 ms of which 4 ms to minimize.
[2024-05-29 01:22:58] [INFO ] Deduced a trap composed of 22 places in 686 ms of which 1 ms to minimize.
[2024-05-29 01:22:58] [INFO ] Deduced a trap composed of 25 places in 685 ms of which 1 ms to minimize.
[2024-05-29 01:22:59] [INFO ] Deduced a trap composed of 38 places in 625 ms of which 2 ms to minimize.
[2024-05-29 01:23:00] [INFO ] Deduced a trap composed of 33 places in 666 ms of which 1 ms to minimize.
[2024-05-29 01:23:00] [INFO ] Deduced a trap composed of 20 places in 626 ms of which 1 ms to minimize.
[2024-05-29 01:23:01] [INFO ] Deduced a trap composed of 14 places in 654 ms of which 2 ms to minimize.
[2024-05-29 01:23:02] [INFO ] Deduced a trap composed of 16 places in 647 ms of which 1 ms to minimize.
[2024-05-29 01:23:03] [INFO ] Deduced a trap composed of 29 places in 690 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:23:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 01:23:03] [INFO ] After 25661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 1 properties in 722 ms.
Support contains 9 out of 2658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2658 transition count 2357
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2407 transition count 2357
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2407 transition count 2106
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2156 transition count 2106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1009 place count 2151 transition count 2101
Iterating global reduction 2 with 5 rules applied. Total rules applied 1014 place count 2151 transition count 2101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1014 place count 2151 transition count 2098
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1020 place count 2148 transition count 2098
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 7 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 2 with 1782 rules applied. Total rules applied 2802 place count 1257 transition count 1207
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 343 times.
Drop transitions removed 343 transitions
Iterating global reduction 2 with 343 rules applied. Total rules applied 3145 place count 1257 transition count 1207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3146 place count 1256 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3147 place count 1255 transition count 1206
Applied a total of 3147 rules in 683 ms. Remains 1255 /2658 variables (removed 1403) and now considering 1206/2608 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 1255/2658 places, 1206/2608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1206 rows 1255 cols
[2024-05-29 01:23:04] [INFO ] Computed 450 invariants in 53 ms
[2024-05-29 01:23:05] [INFO ] [Real]Absence check using 447 positive place invariants in 73 ms returned sat
[2024-05-29 01:23:05] [INFO ] [Real]Absence check using 447 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 01:23:05] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 01:23:05] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-29 01:23:05] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 01:23:06] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-29 01:23:06] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-29 01:23:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:23:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 01:23:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 812 ms
[2024-05-29 01:23:06] [INFO ] After 1367ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:23:06] [INFO ] After 1631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:23:06] [INFO ] [Nat]Absence check using 447 positive place invariants in 84 ms returned sat
[2024-05-29 01:23:06] [INFO ] [Nat]Absence check using 447 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 01:23:07] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:23:07] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2024-05-29 01:23:07] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:23:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 01:23:07] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:23:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 419 ms
[2024-05-29 01:23:07] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-29 01:23:07] [INFO ] After 1276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1206/1206 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1251 transition count 1202
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 1251 transition count 1202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1250 transition count 1201
Applied a total of 14 rules in 125 ms. Remains 1250 /1255 variables (removed 5) and now considering 1201/1206 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 1250/1255 places, 1201/1206 transitions.
Finished random walk after 9930 steps, including 2 resets, run visited all 1 properties in 127 ms. (steps per millisecond=78 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPs-PT-050B-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 603 stabilizing places and 603 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2653 transition count 2603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2653 transition count 2603
Applied a total of 10 rules in 255 ms. Remains 2653 /2658 variables (removed 5) and now considering 2603/2608 (removed 5) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2024-05-29 01:23:08] [INFO ] Computed 451 invariants in 19 ms
[2024-05-29 01:23:09] [INFO ] Implicit Places using invariants in 943 ms returned []
[2024-05-29 01:23:09] [INFO ] Invariant cache hit.
[2024-05-29 01:23:13] [INFO ] Implicit Places using invariants and state equation in 3416 ms returned []
Implicit Place search using SMT with State Equation took 4362 ms to find 0 implicit places.
[2024-05-29 01:23:13] [INFO ] Invariant cache hit.
[2024-05-29 01:23:15] [INFO ] Dead Transitions using invariants and state equation in 2100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2658 places, 2603/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6719 ms. Remains : 2653/2658 places, 2603/2608 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s869 0), p0:(OR (EQ s2306 0) (EQ s2331 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16 reset in 1047 ms.
Product exploration explored 100000 steps with 16 reset in 1246 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:23:18] [INFO ] Invariant cache hit.
[2024-05-29 01:23:18] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:23:18] [INFO ] [Nat]Absence check using 451 positive place invariants in 161 ms returned sat
[2024-05-29 01:23:20] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:23:21] [INFO ] Deduced a trap composed of 23 places in 804 ms of which 3 ms to minimize.
[2024-05-29 01:23:22] [INFO ] Deduced a trap composed of 17 places in 830 ms of which 2 ms to minimize.
[2024-05-29 01:23:23] [INFO ] Deduced a trap composed of 18 places in 832 ms of which 1 ms to minimize.
[2024-05-29 01:23:23] [INFO ] Deduced a trap composed of 20 places in 643 ms of which 2 ms to minimize.
[2024-05-29 01:23:24] [INFO ] Deduced a trap composed of 21 places in 795 ms of which 2 ms to minimize.
[2024-05-29 01:23:25] [INFO ] Deduced a trap composed of 11 places in 807 ms of which 1 ms to minimize.
[2024-05-29 01:23:26] [INFO ] Deduced a trap composed of 17 places in 819 ms of which 2 ms to minimize.
[2024-05-29 01:23:27] [INFO ] Deduced a trap composed of 20 places in 819 ms of which 2 ms to minimize.
[2024-05-29 01:23:28] [INFO ] Deduced a trap composed of 18 places in 680 ms of which 1 ms to minimize.
[2024-05-29 01:23:29] [INFO ] Deduced a trap composed of 24 places in 750 ms of which 2 ms to minimize.
[2024-05-29 01:23:29] [INFO ] Deduced a trap composed of 22 places in 800 ms of which 1 ms to minimize.
[2024-05-29 01:23:30] [INFO ] Deduced a trap composed of 26 places in 775 ms of which 3 ms to minimize.
[2024-05-29 01:23:31] [INFO ] Deduced a trap composed of 14 places in 787 ms of which 2 ms to minimize.
[2024-05-29 01:23:32] [INFO ] Deduced a trap composed of 29 places in 718 ms of which 2 ms to minimize.
[2024-05-29 01:23:33] [INFO ] Deduced a trap composed of 25 places in 779 ms of which 2 ms to minimize.
[2024-05-29 01:23:34] [INFO ] Deduced a trap composed of 16 places in 630 ms of which 1 ms to minimize.
[2024-05-29 01:23:34] [INFO ] Deduced a trap composed of 22 places in 768 ms of which 1 ms to minimize.
[2024-05-29 01:23:35] [INFO ] Deduced a trap composed of 14 places in 752 ms of which 2 ms to minimize.
[2024-05-29 01:23:36] [INFO ] Deduced a trap composed of 30 places in 742 ms of which 1 ms to minimize.
[2024-05-29 01:23:37] [INFO ] Deduced a trap composed of 23 places in 703 ms of which 2 ms to minimize.
[2024-05-29 01:23:38] [INFO ] Deduced a trap composed of 25 places in 724 ms of which 1 ms to minimize.
[2024-05-29 01:23:38] [INFO ] Deduced a trap composed of 17 places in 704 ms of which 1 ms to minimize.
[2024-05-29 01:23:39] [INFO ] Deduced a trap composed of 38 places in 694 ms of which 2 ms to minimize.
[2024-05-29 01:23:40] [INFO ] Deduced a trap composed of 23 places in 672 ms of which 1 ms to minimize.
[2024-05-29 01:23:41] [INFO ] Deduced a trap composed of 35 places in 681 ms of which 2 ms to minimize.
[2024-05-29 01:23:41] [INFO ] Deduced a trap composed of 31 places in 655 ms of which 1 ms to minimize.
[2024-05-29 01:23:42] [INFO ] Deduced a trap composed of 22 places in 678 ms of which 3 ms to minimize.
[2024-05-29 01:23:43] [INFO ] Deduced a trap composed of 29 places in 688 ms of which 3 ms to minimize.
[2024-05-29 01:23:44] [INFO ] Deduced a trap composed of 24 places in 703 ms of which 13 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:23:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 01:23:44] [INFO ] After 25713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 2653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2653 transition count 2352
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2402 transition count 2352
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2402 transition count 2101
Deduced a syphon composed of 251 places in 8 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2151 transition count 2101
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 4 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 2802 place count 1252 transition count 1202
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 348 times.
Drop transitions removed 348 transitions
Iterating global reduction 2 with 348 rules applied. Total rules applied 3150 place count 1252 transition count 1202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3151 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3152 place count 1250 transition count 1201
Applied a total of 3152 rules in 428 ms. Remains 1250 /2653 variables (removed 1403) and now considering 1201/2603 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 1250/2653 places, 1201/2603 transitions.
Finished random walk after 2211 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2652 transition count 2352
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2402 transition count 2352
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2402 transition count 2101
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2151 transition count 2101
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 3 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 2 with 1792 rules applied. Total rules applied 2794 place count 1255 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2796 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2797 place count 1252 transition count 1203
Applied a total of 2797 rules in 398 ms. Remains 1252 /2653 variables (removed 1401) and now considering 1203/2603 (removed 1400) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2024-05-29 01:23:45] [INFO ] Computed 450 invariants in 9 ms
[2024-05-29 01:23:46] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-05-29 01:23:46] [INFO ] Invariant cache hit.
[2024-05-29 01:23:47] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
[2024-05-29 01:23:47] [INFO ] Redundant transitions in 214 ms returned [1202]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2024-05-29 01:23:47] [INFO ] Computed 450 invariants in 12 ms
[2024-05-29 01:23:48] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/2653 places, 1202/2603 transitions.
Applied a total of 0 rules in 43 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3623 ms. Remains : 1252/2653 places, 1202/2603 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1606 steps, including 0 resets, run visited all 2 properties in 20 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 39 reset in 898 ms.
Product exploration explored 100000 steps with 38 reset in 1128 ms.
Built C files in :
/tmp/ltsmin8960906667766607012
[2024-05-29 01:23:51] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-29 01:23:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:23:51] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-29 01:23:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:23:51] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-29 01:23:51] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:23:51] [INFO ] Built C files in 250ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8960906667766607012
Running compilation step : cd /tmp/ltsmin8960906667766607012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8960906667766607012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8960906667766607012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 55 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-29 01:23:54] [INFO ] Invariant cache hit.
[2024-05-29 01:23:55] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-29 01:23:55] [INFO ] Invariant cache hit.
[2024-05-29 01:23:56] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2024-05-29 01:23:56] [INFO ] Redundant transitions in 128 ms returned []
[2024-05-29 01:23:56] [INFO ] Invariant cache hit.
[2024-05-29 01:23:57] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3006 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Built C files in :
/tmp/ltsmin5261090407368941662
[2024-05-29 01:23:57] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-29 01:23:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:23:57] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-29 01:23:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:23:57] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-29 01:23:57] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:23:57] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5261090407368941662
Running compilation step : cd /tmp/ltsmin5261090407368941662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5261090407368941662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5261090407368941662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:24:01] [INFO ] Flatten gal took : 51 ms
[2024-05-29 01:24:01] [INFO ] Flatten gal took : 48 ms
[2024-05-29 01:24:01] [INFO ] Time to serialize gal into /tmp/LTL267223743595722472.gal : 13 ms
[2024-05-29 01:24:01] [INFO ] Time to serialize properties into /tmp/LTL10750819936656324933.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL267223743595722472.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2350034926412632399.hoa' '-atoms' '/tmp/LTL10750819936656324933.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10750819936656324933.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2350034926412632399.hoa
Detected timeout of ITS tools.
[2024-05-29 01:24:16] [INFO ] Flatten gal took : 42 ms
[2024-05-29 01:24:16] [INFO ] Flatten gal took : 42 ms
[2024-05-29 01:24:16] [INFO ] Time to serialize gal into /tmp/LTL469607117477669321.gal : 8 ms
[2024-05-29 01:24:16] [INFO ] Time to serialize properties into /tmp/LTL8568178406872376327.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL469607117477669321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8568178406872376327.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p2606==0)||(p2635==0))")))||(G("(p977==0)")))))
Formula 0 simplified : X(GF!"((p2606==0)||(p2635==0))" & F!"(p977==0)")
Detected timeout of ITS tools.
[2024-05-29 01:24:31] [INFO ] Flatten gal took : 43 ms
[2024-05-29 01:24:31] [INFO ] Applying decomposition
[2024-05-29 01:24:31] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11833431403464310376.txt' '-o' '/tmp/graph11833431403464310376.bin' '-w' '/tmp/graph11833431403464310376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11833431403464310376.bin' '-l' '-1' '-v' '-w' '/tmp/graph11833431403464310376.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:24:31] [INFO ] Decomposing Gal with order
[2024-05-29 01:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:24:31] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 01:24:32] [INFO ] Flatten gal took : 148 ms
[2024-05-29 01:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 19 ms.
[2024-05-29 01:24:32] [INFO ] Time to serialize gal into /tmp/LTL233250446349492839.gal : 15 ms
[2024-05-29 01:24:32] [INFO ] Time to serialize properties into /tmp/LTL6338417394478398827.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL233250446349492839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6338417394478398827.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i25.u391.p2606==0)||(i25.u396.p2635==0))")))||(G("(i9.u144.p977==0)")))))
Formula 0 simplified : X(GF!"((i25.u391.p2606==0)||(i25.u396.p2635==0))" & F!"(i9.u144.p977==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8093736815420868326
[2024-05-29 01:24:47] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8093736815420868326
Running compilation step : cd /tmp/ltsmin8093736815420868326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2246 ms.
Running link step : cd /tmp/ltsmin8093736815420868326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin8093736815420868326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-01 finished in 113731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1 U (p2||G(p1)))))))'
Support contains 4 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2653 transition count 2603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2653 transition count 2603
Applied a total of 10 rules in 312 ms. Remains 2653 /2658 variables (removed 5) and now considering 2603/2608 (removed 5) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2024-05-29 01:25:02] [INFO ] Computed 451 invariants in 16 ms
[2024-05-29 01:25:03] [INFO ] Implicit Places using invariants in 977 ms returned []
[2024-05-29 01:25:03] [INFO ] Invariant cache hit.
[2024-05-29 01:25:06] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 4080 ms to find 0 implicit places.
[2024-05-29 01:25:06] [INFO ] Invariant cache hit.
[2024-05-29 01:25:08] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2658 places, 2603/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6301 ms. Remains : 2653/2658 places, 2603/2608 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s2240 1) (NEQ s579 1)), p1:(NEQ s579 1), p0:(OR (EQ s2269 0) (EQ s1620 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1392 ms.
Product exploration explored 100000 steps with 50000 reset in 1370 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/2653 stabilizing places and 600/2603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 528 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-02 finished in 9876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2652 transition count 2602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2652 transition count 2602
Applied a total of 12 rules in 314 ms. Remains 2652 /2658 variables (removed 6) and now considering 2602/2608 (removed 6) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2024-05-29 01:25:12] [INFO ] Computed 451 invariants in 14 ms
[2024-05-29 01:25:13] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-05-29 01:25:13] [INFO ] Invariant cache hit.
[2024-05-29 01:25:16] [INFO ] Implicit Places using invariants and state equation in 3113 ms returned []
Implicit Place search using SMT with State Equation took 4148 ms to find 0 implicit places.
[2024-05-29 01:25:16] [INFO ] Invariant cache hit.
[2024-05-29 01:25:18] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2658 places, 2602/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6371 ms. Remains : 2652/2658 places, 2602/2608 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s1325 1), p0:(EQ s2105 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, null][false, false, false]]
Product exploration explored 100000 steps with 137 reset in 548 ms.
Product exploration explored 100000 steps with 133 reset in 623 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/2652 stabilizing places and 599/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 905 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 220 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 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
[2024-05-29 01:25:20] [INFO ] Invariant cache hit.
[2024-05-29 01:25:22] [INFO ] [Real]Absence check using 451 positive place invariants in 881 ms returned sat
[2024-05-29 01:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:25:35] [INFO ] [Real]Absence check using state equation in 12502 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2652 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2651 transition count 2350
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2400 transition count 2350
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2400 transition count 2099
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2149 transition count 2099
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2790 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2792 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 1253 transition count 1204
Applied a total of 2793 rules in 379 ms. Remains 1253 /2652 variables (removed 1399) and now considering 1204/2602 (removed 1398) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-05-29 01:25:35] [INFO ] Computed 450 invariants in 10 ms
[2024-05-29 01:25:36] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-29 01:25:36] [INFO ] Invariant cache hit.
[2024-05-29 01:25:38] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
[2024-05-29 01:25:38] [INFO ] Redundant transitions in 130 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-29 01:25:38] [INFO ] Computed 450 invariants in 4 ms
[2024-05-29 01:25:38] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2652 places, 1203/2602 transitions.
Applied a total of 0 rules in 38 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3481 ms. Remains : 1253/2652 places, 1203/2602 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 158 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 35 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 203 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2024-05-29 01:25:39] [INFO ] Invariant cache hit.
[2024-05-29 01:25:40] [INFO ] [Real]Absence check using 450 positive place invariants in 301 ms returned sat
[2024-05-29 01:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:25:44] [INFO ] [Real]Absence check using state equation in 3499 ms returned sat
[2024-05-29 01:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:25:45] [INFO ] [Nat]Absence check using 450 positive place invariants in 282 ms returned sat
[2024-05-29 01:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:25:48] [INFO ] [Nat]Absence check using state equation in 3062 ms returned sat
[2024-05-29 01:25:48] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 01:25:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 01:25:48] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 01:25:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2024-05-29 01:25:48] [INFO ] Computed and/alt/rep : 1196/2989/1196 causal constraints (skipped 4 transitions) in 74 ms.
[2024-05-29 01:25:59] [INFO ] Deduced a trap composed of 2 places in 714 ms of which 2 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:25:59] [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 p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22493 reset in 974 ms.
Product exploration explored 100000 steps with 22588 reset in 1149 ms.
Built C files in :
/tmp/ltsmin14893505787388790480
[2024-05-29 01:26:02] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-29 01:26:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:26:02] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-29 01:26:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:26:02] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-29 01:26:02] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:26:02] [INFO ] Built C files in 248ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14893505787388790480
Running compilation step : cd /tmp/ltsmin14893505787388790480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14893505787388790480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14893505787388790480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1251 transition count 1201
Applied a total of 1 rules in 68 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-29 01:26:05] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 01:26:06] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-29 01:26:06] [INFO ] Invariant cache hit.
[2024-05-29 01:26:07] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2024-05-29 01:26:07] [INFO ] Redundant transitions in 137 ms returned []
[2024-05-29 01:26:07] [INFO ] Invariant cache hit.
[2024-05-29 01:26:08] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/1253 places, 1201/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3001 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Built C files in :
/tmp/ltsmin2989182149072446691
[2024-05-29 01:26:08] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2024-05-29 01:26:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:26:08] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2024-05-29 01:26:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:26:08] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2024-05-29 01:26:08] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:26:08] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2989182149072446691
Running compilation step : cd /tmp/ltsmin2989182149072446691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2989182149072446691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2989182149072446691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:26:11] [INFO ] Flatten gal took : 47 ms
[2024-05-29 01:26:11] [INFO ] Flatten gal took : 36 ms
[2024-05-29 01:26:11] [INFO ] Time to serialize gal into /tmp/LTL2281690954969307269.gal : 7 ms
[2024-05-29 01:26:11] [INFO ] Time to serialize properties into /tmp/LTL5957229348795690692.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2281690954969307269.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5479642750332065046.hoa' '-atoms' '/tmp/LTL5957229348795690692.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5957229348795690692.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5479642750332065046.hoa
Detected timeout of ITS tools.
[2024-05-29 01:26:26] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:26:26] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:26:26] [INFO ] Time to serialize gal into /tmp/LTL6894355311659186172.gal : 7 ms
[2024-05-29 01:26:26] [INFO ] Time to serialize properties into /tmp/LTL4194072763395236259.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6894355311659186172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4194072763395236259.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(p2378==1)"))||(X(F("(p1493==1)")))))
Formula 0 simplified : F!"(p2378==1)" & XG!"(p1493==1)"
Detected timeout of ITS tools.
[2024-05-29 01:26:42] [INFO ] Flatten gal took : 37 ms
[2024-05-29 01:26:42] [INFO ] Applying decomposition
[2024-05-29 01:26:42] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12286435412841455303.txt' '-o' '/tmp/graph12286435412841455303.bin' '-w' '/tmp/graph12286435412841455303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12286435412841455303.bin' '-l' '-1' '-v' '-w' '/tmp/graph12286435412841455303.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:26:42] [INFO ] Decomposing Gal with order
[2024-05-29 01:26:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:26:42] [INFO ] Removed a total of 799 redundant transitions.
[2024-05-29 01:26:42] [INFO ] Flatten gal took : 68 ms
[2024-05-29 01:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 24 ms.
[2024-05-29 01:26:42] [INFO ] Time to serialize gal into /tmp/LTL12116054442368900332.gal : 30 ms
[2024-05-29 01:26:42] [INFO ] Time to serialize properties into /tmp/LTL7695061040429876730.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12116054442368900332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7695061040429876730.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(i21.u358.p2378==1)"))||(X(F("(i12.u222.p1493==1)")))))
Formula 0 simplified : F!"(i21.u358.p2378==1)" & XG!"(i12.u222.p1493==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17534289190572581191
[2024-05-29 01:26:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17534289190572581191
Running compilation step : cd /tmp/ltsmin17534289190572581191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2317 ms.
Running link step : cd /tmp/ltsmin17534289190572581191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17534289190572581191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-05 finished in 120455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Support contains 3 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2652 transition count 2602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2652 transition count 2602
Applied a total of 12 rules in 318 ms. Remains 2652 /2658 variables (removed 6) and now considering 2602/2608 (removed 6) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2024-05-29 01:27:12] [INFO ] Computed 451 invariants in 24 ms
[2024-05-29 01:27:13] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2024-05-29 01:27:13] [INFO ] Invariant cache hit.
[2024-05-29 01:27:17] [INFO ] Implicit Places using invariants and state equation in 3172 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
[2024-05-29 01:27:17] [INFO ] Invariant cache hit.
[2024-05-29 01:27:19] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2658 places, 2602/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6460 ms. Remains : 2652/2658 places, 2602/2608 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2184 1), p1:(AND (EQ s2045 1) (EQ s2070 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 726 ms.
Product exploration explored 100000 steps with 81 reset in 872 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Finished random walk after 1823 steps, including 0 resets, run visited all 4 properties in 33 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
[2024-05-29 01:27:21] [INFO ] Invariant cache hit.
[2024-05-29 01:27:24] [INFO ] [Real]Absence check using 451 positive place invariants in 840 ms returned sat
[2024-05-29 01:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:27:36] [INFO ] [Real]Absence check using state equation in 12500 ms returned unknown
Could not prove EG (NOT p1)
[2024-05-29 01:27:36] [INFO ] Invariant cache hit.
[2024-05-29 01:27:39] [INFO ] [Real]Absence check using 451 positive place invariants in 840 ms returned sat
[2024-05-29 01:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:27:51] [INFO ] [Real]Absence check using state equation in 12524 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 2651 transition count 2352
Reduce places removed 249 places and 0 transitions.
Iterating post reduction 1 with 249 rules applied. Total rules applied 498 place count 2402 transition count 2352
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 498 place count 2402 transition count 2102
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 998 place count 2152 transition count 2102
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 3 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 2 with 1792 rules applied. Total rules applied 2790 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2792 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 1253 transition count 1204
Applied a total of 2793 rules in 414 ms. Remains 1253 /2652 variables (removed 1399) and now considering 1204/2602 (removed 1398) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-05-29 01:27:52] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:27:53] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-05-29 01:27:53] [INFO ] Invariant cache hit.
[2024-05-29 01:27:54] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2024-05-29 01:27:54] [INFO ] Redundant transitions in 140 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-29 01:27:54] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 01:27:55] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2652 places, 1203/2602 transitions.
Applied a total of 0 rules in 32 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3381 ms. Remains : 1253/2652 places, 1203/2602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 318 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Finished random walk after 5650 steps, including 2 resets, run visited all 4 properties in 68 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p0), (F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 362 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
[2024-05-29 01:27:56] [INFO ] Invariant cache hit.
[2024-05-29 01:27:57] [INFO ] [Real]Absence check using 450 positive place invariants in 273 ms returned sat
[2024-05-29 01:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:28:01] [INFO ] [Real]Absence check using state equation in 3183 ms returned sat
[2024-05-29 01:28:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:28:02] [INFO ] [Nat]Absence check using 450 positive place invariants in 296 ms returned sat
[2024-05-29 01:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:28:05] [INFO ] [Nat]Absence check using state equation in 3391 ms returned sat
[2024-05-29 01:28:05] [INFO ] Computed and/alt/rep : 1200/2996/1200 causal constraints (skipped 0 transitions) in 78 ms.
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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:28:16] [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 p1)
Could not prove EG (NOT p1)
[2024-05-29 01:28:16] [INFO ] Invariant cache hit.
[2024-05-29 01:28:17] [INFO ] [Real]Absence check using 450 positive place invariants in 278 ms returned sat
[2024-05-29 01:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:28:21] [INFO ] [Real]Absence check using state equation in 3832 ms returned sat
[2024-05-29 01:28:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:28:22] [INFO ] [Nat]Absence check using 450 positive place invariants in 278 ms returned sat
[2024-05-29 01:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:28:25] [INFO ] [Nat]Absence check using state equation in 3312 ms returned sat
[2024-05-29 01:28:25] [INFO ] Computed and/alt/rep : 1200/2996/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2024-05-29 01:28:36] [INFO ] Added : 500 causal constraints over 100 iterations in 10522 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Product exploration explored 100000 steps with 273 reset in 883 ms.
Product exploration explored 100000 steps with 284 reset in 1111 ms.
Built C files in :
/tmp/ltsmin9375187408679358321
[2024-05-29 01:28:38] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-29 01:28:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:28:38] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-29 01:28:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:28:38] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-29 01:28:38] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:28:38] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9375187408679358321
Running compilation step : cd /tmp/ltsmin9375187408679358321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9375187408679358321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9375187408679358321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 39 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-29 01:28:41] [INFO ] Invariant cache hit.
[2024-05-29 01:28:42] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-29 01:28:42] [INFO ] Invariant cache hit.
[2024-05-29 01:28:43] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
[2024-05-29 01:28:44] [INFO ] Redundant transitions in 132 ms returned []
[2024-05-29 01:28:44] [INFO ] Invariant cache hit.
[2024-05-29 01:28:44] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2990 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Built C files in :
/tmp/ltsmin18216897947705274723
[2024-05-29 01:28:44] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-29 01:28:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:28:44] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-29 01:28:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:28:44] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-29 01:28:44] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:28:44] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18216897947705274723
Running compilation step : cd /tmp/ltsmin18216897947705274723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18216897947705274723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18216897947705274723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:28:48] [INFO ] Flatten gal took : 36 ms
[2024-05-29 01:28:48] [INFO ] Flatten gal took : 37 ms
[2024-05-29 01:28:48] [INFO ] Time to serialize gal into /tmp/LTL2262508395874191809.gal : 8 ms
[2024-05-29 01:28:48] [INFO ] Time to serialize properties into /tmp/LTL1481040703185713935.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2262508395874191809.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6981291265038012084.hoa' '-atoms' '/tmp/LTL1481040703185713935.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1481040703185713935.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6981291265038012084.hoa
Detected timeout of ITS tools.
[2024-05-29 01:29:03] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:29:03] [INFO ] Flatten gal took : 34 ms
[2024-05-29 01:29:03] [INFO ] Time to serialize gal into /tmp/LTL17013755027524750742.gal : 7 ms
[2024-05-29 01:29:03] [INFO ] Time to serialize properties into /tmp/LTL13204518810161423329.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17013755027524750742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13204518810161423329.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(p2470==1)"))&&(G(F("((p2311==1)&&(p2340==1))"))))))
Formula 0 simplified : X(G!"(p2470==1)" | FG!"((p2311==1)&&(p2340==1))")
Detected timeout of ITS tools.
[2024-05-29 01:29:18] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:29:18] [INFO ] Applying decomposition
[2024-05-29 01:29:18] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph8714904020986250790.txt' '-o' '/tmp/graph8714904020986250790.bin' '-w' '/tmp/graph8714904020986250790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8714904020986250790.bin' '-l' '-1' '-v' '-w' '/tmp/graph8714904020986250790.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:29:18] [INFO ] Decomposing Gal with order
[2024-05-29 01:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:29:18] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 01:29:18] [INFO ] Flatten gal took : 60 ms
[2024-05-29 01:29:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 728 labels/synchronizations in 12 ms.
[2024-05-29 01:29:18] [INFO ] Time to serialize gal into /tmp/LTL12481515649957952705.gal : 11 ms
[2024-05-29 01:29:18] [INFO ] Time to serialize properties into /tmp/LTL2784188653320880862.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12481515649957952705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2784188653320880862.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(i24.u372.p2470==1)"))&&(G(F("((i22.u346.p2311==1)&&(i22.u351.p2340==1))"))))))
Formula 0 simplified : X(G!"(i24.u372.p2470==1)" | FG!"((i22.u346.p2311==1)&&(i22.u351.p2340==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10455228804444704809
[2024-05-29 01:29:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10455228804444704809
Running compilation step : cd /tmp/ltsmin10455228804444704809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2241 ms.
Running link step : cd /tmp/ltsmin10455228804444704809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10455228804444704809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-06 finished in 156165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(X(F(!p0)))) U !p1)))'
Support contains 2 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2653 transition count 2603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2653 transition count 2603
Applied a total of 10 rules in 311 ms. Remains 2653 /2658 variables (removed 5) and now considering 2603/2608 (removed 5) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2024-05-29 01:29:49] [INFO ] Computed 451 invariants in 16 ms
[2024-05-29 01:29:50] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2024-05-29 01:29:50] [INFO ] Invariant cache hit.
[2024-05-29 01:29:53] [INFO ] Implicit Places using invariants and state equation in 3221 ms returned []
Implicit Place search using SMT with State Equation took 4264 ms to find 0 implicit places.
[2024-05-29 01:29:53] [INFO ] Invariant cache hit.
[2024-05-29 01:29:55] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2658 places, 2603/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6500 ms. Remains : 2653/2658 places, 2603/2608 transitions.
Stuttering acceptance computed with spot in 143 ms :[p1, p1, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s1828 1) (EQ s1084 1)), p0:(NEQ s1828 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1350 ms.
Product exploration explored 100000 steps with 50000 reset in 1394 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/2653 stabilizing places and 600/2603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-07 finished in 9468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 2658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2657 transition count 2356
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2406 transition count 2356
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2406 transition count 2105
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2155 transition count 2105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1010 place count 2149 transition count 2099
Iterating global reduction 2 with 6 rules applied. Total rules applied 1016 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1016 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1024 place count 2145 transition count 2095
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2808 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2810 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2811 place count 1250 transition count 1201
Applied a total of 2811 rules in 451 ms. Remains 1250 /2658 variables (removed 1408) and now considering 1201/2608 (removed 1407) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-29 01:29:58] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 01:29:59] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-29 01:29:59] [INFO ] Invariant cache hit.
[2024-05-29 01:30:00] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2024-05-29 01:30:00] [INFO ] Redundant transitions in 142 ms returned [1200]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-29 01:30:00] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:30:01] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/2658 places, 1200/2608 transitions.
Applied a total of 0 rules in 43 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3394 ms. Remains : 1250/2658 places, 1200/2608 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s480 1), p0:(EQ s701 1)], 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2522 steps with 0 reset in 29 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-08 finished in 3543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 4 out of 2658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2657 transition count 2356
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2406 transition count 2356
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2406 transition count 2105
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2155 transition count 2105
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1009 place count 2150 transition count 2100
Iterating global reduction 2 with 5 rules applied. Total rules applied 1014 place count 2150 transition count 2100
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1014 place count 2150 transition count 2096
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1022 place count 2146 transition count 2096
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 3 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 2 with 1776 rules applied. Total rules applied 2798 place count 1258 transition count 1208
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2800 place count 1256 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 1255 transition count 1206
Applied a total of 2801 rules in 461 ms. Remains 1255 /2658 variables (removed 1403) and now considering 1206/2608 (removed 1402) transitions.
// Phase 1: matrix 1206 rows 1255 cols
[2024-05-29 01:30:02] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:30:02] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-29 01:30:02] [INFO ] Invariant cache hit.
[2024-05-29 01:30:04] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2024-05-29 01:30:04] [INFO ] Redundant transitions in 181 ms returned [1205]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2024-05-29 01:30:04] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:30:05] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1255/2658 places, 1205/2608 transitions.
Applied a total of 0 rules in 41 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3478 ms. Remains : 1255/2658 places, 1205/2608 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s164 0) (EQ s186 0)), p1:(EQ s656 1), p2:(EQ s695 1)], nbAcceptance=3, 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 39 reset in 1051 ms.
Product exploration explored 100000 steps with 38 reset in 1213 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/1255 stabilizing places and 3/1205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 454 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 01:30:08] [INFO ] Invariant cache hit.
[2024-05-29 01:30:08] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:30:09] [INFO ] [Nat]Absence check using 450 positive place invariants in 78 ms returned sat
[2024-05-29 01:30:09] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:30:10] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-29 01:30:10] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2024-05-29 01:30:10] [INFO ] After 1209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-29 01:30:10] [INFO ] After 1739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 168 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1255 transition count 1205
Applied a total of 298 rules in 64 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 125649 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125649 steps, saw 123643 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1205 rows 1255 cols
[2024-05-29 01:30:14] [INFO ] Computed 450 invariants in 26 ms
[2024-05-29 01:30:14] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:30:14] [INFO ] [Nat]Absence check using 450 positive place invariants in 77 ms returned sat
[2024-05-29 01:30:15] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:30:15] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 01:30:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:30:16] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:30:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 01:30:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 386 ms
[2024-05-29 01:30:16] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-29 01:30:16] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-29 01:30:16] [INFO ] After 1576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-05-29 01:30:16] [INFO ] After 2117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 137 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 32 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 32 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-29 01:30:17] [INFO ] Invariant cache hit.
[2024-05-29 01:30:17] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-29 01:30:17] [INFO ] Invariant cache hit.
[2024-05-29 01:30:19] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
[2024-05-29 01:30:19] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 01:30:19] [INFO ] Invariant cache hit.
[2024-05-29 01:30:20] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3182 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 35 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 01:30:20] [INFO ] Invariant cache hit.
[2024-05-29 01:30:20] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:30:20] [INFO ] [Nat]Absence check using 450 positive place invariants in 76 ms returned sat
[2024-05-29 01:30:21] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:30:21] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 01:30:21] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 01:30:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 01:30:21] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 01:30:21] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1233 ms
[2024-05-29 01:30:22] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-29 01:30:23] [INFO ] After 2290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 179 ms.
[2024-05-29 01:30:23] [INFO ] After 2817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p1 p0 (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 616 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 37 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2024-05-29 01:30:23] [INFO ] Computed 450 invariants in 9 ms
[2024-05-29 01:30:24] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-29 01:30:24] [INFO ] Invariant cache hit.
[2024-05-29 01:30:26] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
[2024-05-29 01:30:26] [INFO ] Redundant transitions in 136 ms returned []
[2024-05-29 01:30:26] [INFO ] Invariant cache hit.
[2024-05-29 01:30:26] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2970 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/1255 stabilizing places and 3/1205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
Knowledge based reduction with 14 factoid took 459 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 01:30:28] [INFO ] Invariant cache hit.
[2024-05-29 01:30:28] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:30:28] [INFO ] [Nat]Absence check using 450 positive place invariants in 75 ms returned sat
[2024-05-29 01:30:29] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:30:29] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 01:30:29] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2024-05-29 01:30:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2024-05-29 01:30:29] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-05-29 01:30:29] [INFO ] After 1710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 171 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1255 transition count 1205
Applied a total of 298 rules in 64 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 149664 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149664 steps, saw 147350 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1205 rows 1255 cols
[2024-05-29 01:30:33] [INFO ] Computed 450 invariants in 7 ms
[2024-05-29 01:30:33] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:30:34] [INFO ] [Nat]Absence check using 450 positive place invariants in 73 ms returned sat
[2024-05-29 01:30:35] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:30:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:30:35] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-29 01:30:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 01:30:35] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 01:30:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 393 ms
[2024-05-29 01:30:35] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-29 01:30:35] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 01:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-29 01:30:35] [INFO ] After 1576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-29 01:30:36] [INFO ] After 2154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 99 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 35 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 31 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-29 01:30:36] [INFO ] Invariant cache hit.
[2024-05-29 01:30:37] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-29 01:30:37] [INFO ] Invariant cache hit.
[2024-05-29 01:30:38] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2565 ms to find 0 implicit places.
[2024-05-29 01:30:38] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 01:30:38] [INFO ] Invariant cache hit.
[2024-05-29 01:30:39] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3291 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 33 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 01:30:39] [INFO ] Invariant cache hit.
[2024-05-29 01:30:39] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 01:30:40] [INFO ] [Nat]Absence check using 450 positive place invariants in 77 ms returned sat
[2024-05-29 01:30:40] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 01:30:40] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:30:41] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 01:30:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1199 ms
[2024-05-29 01:30:42] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 01:30:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-29 01:30:42] [INFO ] After 2225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-29 01:30:42] [INFO ] After 2776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (AND p1 p0 (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 637 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 39 reset in 1075 ms.
Product exploration explored 100000 steps with 38 reset in 1309 ms.
Built C files in :
/tmp/ltsmin3724759486664506371
[2024-05-29 01:30:45] [INFO ] Computing symmetric may disable matrix : 1205 transitions.
[2024-05-29 01:30:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:30:45] [INFO ] Computing symmetric may enable matrix : 1205 transitions.
[2024-05-29 01:30:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:30:45] [INFO ] Computing Do-Not-Accords matrix : 1205 transitions.
[2024-05-29 01:30:45] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:30:45] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3724759486664506371
Running compilation step : cd /tmp/ltsmin3724759486664506371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3724759486664506371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3724759486664506371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 31 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2024-05-29 01:30:49] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 01:30:49] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-29 01:30:49] [INFO ] Invariant cache hit.
[2024-05-29 01:30:51] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2024-05-29 01:30:51] [INFO ] Redundant transitions in 140 ms returned []
[2024-05-29 01:30:51] [INFO ] Invariant cache hit.
[2024-05-29 01:30:51] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2882 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Built C files in :
/tmp/ltsmin14688627114972336553
[2024-05-29 01:30:51] [INFO ] Computing symmetric may disable matrix : 1205 transitions.
[2024-05-29 01:30:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:30:51] [INFO ] Computing symmetric may enable matrix : 1205 transitions.
[2024-05-29 01:30:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:30:52] [INFO ] Computing Do-Not-Accords matrix : 1205 transitions.
[2024-05-29 01:30:52] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:30:52] [INFO ] Built C files in 250ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14688627114972336553
Running compilation step : cd /tmp/ltsmin14688627114972336553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14688627114972336553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14688627114972336553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:30:55] [INFO ] Flatten gal took : 37 ms
[2024-05-29 01:30:55] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:30:55] [INFO ] Time to serialize gal into /tmp/LTL3955975523829596328.gal : 6 ms
[2024-05-29 01:30:55] [INFO ] Time to serialize properties into /tmp/LTL5254462082350734223.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3955975523829596328.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7814930812784368849.hoa' '-atoms' '/tmp/LTL5254462082350734223.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5254462082350734223.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7814930812784368849.hoa
Detected timeout of ITS tools.
[2024-05-29 01:31:10] [INFO ] Flatten gal took : 45 ms
[2024-05-29 01:31:10] [INFO ] Flatten gal took : 38 ms
[2024-05-29 01:31:10] [INFO ] Time to serialize gal into /tmp/LTL7370968507321602539.gal : 6 ms
[2024-05-29 01:31:10] [INFO ] Time to serialize properties into /tmp/LTL10140521257381834973.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7370968507321602539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10140521257381834973.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("((p433==0)||(p484==0))"))||(G("(p1590==1)")))||(G("(p1673==1)")))))
Formula 0 simplified : G(F!"((p433==0)||(p484==0))" & F!"(p1590==1)" & F!"(p1673==1)")
Detected timeout of ITS tools.
[2024-05-29 01:31:25] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:31:25] [INFO ] Applying decomposition
[2024-05-29 01:31:25] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17018319075737397498.txt' '-o' '/tmp/graph17018319075737397498.bin' '-w' '/tmp/graph17018319075737397498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17018319075737397498.bin' '-l' '-1' '-v' '-w' '/tmp/graph17018319075737397498.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:31:25] [INFO ] Decomposing Gal with order
[2024-05-29 01:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:31:25] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-29 01:31:25] [INFO ] Flatten gal took : 74 ms
[2024-05-29 01:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 728 labels/synchronizations in 20 ms.
[2024-05-29 01:31:25] [INFO ] Time to serialize gal into /tmp/LTL4477831600615504555.gal : 25 ms
[2024-05-29 01:31:25] [INFO ] Time to serialize properties into /tmp/LTL5448246932173716112.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4477831600615504555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5448246932173716112.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(((G("((i4.u60.p433==0)||(i4.u67.p484==0))"))||(G("(i14.u235.p1590==1)")))||(G("(i15.i0.i0.u250.p1673==1)")))))
Formula 0 simplified : G(F!"((i4.u60.p433==0)||(i4.u67.p484==0))" & F!"(i14.u235.p1590==1)" & F!"(i15.i0.i0.u250.p1673==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10908765058067601114
[2024-05-29 01:31:40] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10908765058067601114
Running compilation step : cd /tmp/ltsmin10908765058067601114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2252 ms.
Running link step : cd /tmp/ltsmin10908765058067601114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10908765058067601114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-09 finished in 114338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2652 transition count 2602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2652 transition count 2602
Applied a total of 12 rules in 322 ms. Remains 2652 /2658 variables (removed 6) and now considering 2602/2608 (removed 6) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2024-05-29 01:31:56] [INFO ] Computed 451 invariants in 14 ms
[2024-05-29 01:31:57] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2024-05-29 01:31:57] [INFO ] Invariant cache hit.
[2024-05-29 01:32:00] [INFO ] Implicit Places using invariants and state equation in 3116 ms returned []
Implicit Place search using SMT with State Equation took 4232 ms to find 0 implicit places.
[2024-05-29 01:32:00] [INFO ] Invariant cache hit.
[2024-05-29 01:32:02] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2658 places, 2602/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6412 ms. Remains : 2652/2658 places, 2602/2608 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s2361 0) (EQ s2369 0) (EQ s2390 0)), p0:(AND (EQ s2523 1) (EQ s2567 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 1027 ms.
Entered a terminal (fully accepting) state of product in 57286 steps with 9 reset in 690 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-10 finished in 8288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))'
Support contains 8 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2652 transition count 2602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2652 transition count 2602
Applied a total of 12 rules in 317 ms. Remains 2652 /2658 variables (removed 6) and now considering 2602/2608 (removed 6) transitions.
[2024-05-29 01:32:04] [INFO ] Invariant cache hit.
[2024-05-29 01:32:05] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-29 01:32:05] [INFO ] Invariant cache hit.
[2024-05-29 01:32:08] [INFO ] Implicit Places using invariants and state equation in 2976 ms returned []
Implicit Place search using SMT with State Equation took 3944 ms to find 0 implicit places.
[2024-05-29 01:32:08] [INFO ] Invariant cache hit.
[2024-05-29 01:32:10] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2658 places, 2602/2608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6248 ms. Remains : 2652/2658 places, 2602/2608 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1633 0) (EQ s1643 0) (EQ s1663 0)), p2:(AND (EQ s2615 1) (EQ s2629 1)), p1:(AND (EQ s2257 1) (EQ s2265 1) (EQ s2287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2647 steps with 0 reset in 30 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-11 finished in 6521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2657 transition count 2356
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2406 transition count 2356
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2406 transition count 2105
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2155 transition count 2105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1010 place count 2149 transition count 2099
Iterating global reduction 2 with 6 rules applied. Total rules applied 1016 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1016 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1024 place count 2145 transition count 2095
Performed 890 Post agglomeration using F-continuation condition.Transition count delta: 890
Deduced a syphon composed of 890 places in 3 ms
Reduce places removed 890 places and 0 transitions.
Iterating global reduction 2 with 1780 rules applied. Total rules applied 2804 place count 1255 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2806 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 1252 transition count 1203
Applied a total of 2807 rules in 482 ms. Remains 1252 /2658 variables (removed 1406) and now considering 1203/2608 (removed 1405) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2024-05-29 01:32:11] [INFO ] Computed 450 invariants in 4 ms
[2024-05-29 01:32:12] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-29 01:32:12] [INFO ] Invariant cache hit.
[2024-05-29 01:32:13] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2024-05-29 01:32:13] [INFO ] Redundant transitions in 146 ms returned [1202]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2024-05-29 01:32:13] [INFO ] Computed 450 invariants in 7 ms
[2024-05-29 01:32:14] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/2658 places, 1202/2608 transitions.
Applied a total of 0 rules in 30 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3452 ms. Remains : 1252/2658 places, 1202/2608 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-12 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:(NEQ s1054 1), p1:(OR (NEQ s833 1) (NEQ s848 1))], 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 116 reset in 980 ms.
Product exploration explored 100000 steps with 137 reset in 1178 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1252 stabilizing places and 2/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 913 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 34 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-29 01:32:17] [INFO ] Invariant cache hit.
[2024-05-29 01:32:18] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-29 01:32:18] [INFO ] Invariant cache hit.
[2024-05-29 01:32:19] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2024-05-29 01:32:19] [INFO ] Redundant transitions in 140 ms returned []
[2024-05-29 01:32:19] [INFO ] Invariant cache hit.
[2024-05-29 01:32:20] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3077 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1252 stabilizing places and 2/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 742 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 191 reset in 972 ms.
Product exploration explored 100000 steps with 137 reset in 1147 ms.
Built C files in :
/tmp/ltsmin5026295713518368188
[2024-05-29 01:32:23] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-29 01:32:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:32:23] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-29 01:32:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:32:23] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-29 01:32:23] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:32:23] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5026295713518368188
Running compilation step : cd /tmp/ltsmin5026295713518368188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5026295713518368188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5026295713518368188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-29 01:32:27] [INFO ] Invariant cache hit.
[2024-05-29 01:32:27] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-29 01:32:27] [INFO ] Invariant cache hit.
[2024-05-29 01:32:29] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2024-05-29 01:32:29] [INFO ] Redundant transitions in 142 ms returned []
[2024-05-29 01:32:29] [INFO ] Invariant cache hit.
[2024-05-29 01:32:30] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3011 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Built C files in :
/tmp/ltsmin2756645102132382230
[2024-05-29 01:32:30] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-29 01:32:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:32:30] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-29 01:32:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:32:30] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-29 01:32:30] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:32:30] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2756645102132382230
Running compilation step : cd /tmp/ltsmin2756645102132382230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2756645102132382230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2756645102132382230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:32:33] [INFO ] Flatten gal took : 36 ms
[2024-05-29 01:32:33] [INFO ] Flatten gal took : 38 ms
[2024-05-29 01:32:33] [INFO ] Time to serialize gal into /tmp/LTL15462228243958556254.gal : 14 ms
[2024-05-29 01:32:33] [INFO ] Time to serialize properties into /tmp/LTL6381001275947303221.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15462228243958556254.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3554155028760525965.hoa' '-atoms' '/tmp/LTL6381001275947303221.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6381001275947303221.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3554155028760525965.hoa
Detected timeout of ITS tools.
[2024-05-29 01:32:48] [INFO ] Flatten gal took : 34 ms
[2024-05-29 01:32:48] [INFO ] Flatten gal took : 43 ms
[2024-05-29 01:32:48] [INFO ] Time to serialize gal into /tmp/LTL4758096685259686197.gal : 6 ms
[2024-05-29 01:32:48] [INFO ] Time to serialize properties into /tmp/LTL2509621682149165315.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4758096685259686197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2509621682149165315.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(p2537!=1)"))&&(F(G("((p2016!=1)||(p2044!=1))"))))))
Formula 0 simplified : F(G!"(p2537!=1)" | GF!"((p2016!=1)||(p2044!=1))")
Detected timeout of ITS tools.
[2024-05-29 01:33:03] [INFO ] Flatten gal took : 36 ms
[2024-05-29 01:33:03] [INFO ] Applying decomposition
[2024-05-29 01:33:03] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph10984804261759510208.txt' '-o' '/tmp/graph10984804261759510208.bin' '-w' '/tmp/graph10984804261759510208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10984804261759510208.bin' '-l' '-1' '-v' '-w' '/tmp/graph10984804261759510208.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:33:03] [INFO ] Decomposing Gal with order
[2024-05-29 01:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:33:04] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-29 01:33:04] [INFO ] Flatten gal took : 86 ms
[2024-05-29 01:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 750 labels/synchronizations in 25 ms.
[2024-05-29 01:33:04] [INFO ] Time to serialize gal into /tmp/LTL13918989313835921217.gal : 26 ms
[2024-05-29 01:33:04] [INFO ] Time to serialize properties into /tmp/LTL11452301697655216377.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13918989313835921217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11452301697655216377.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(i24.u379.p2537!=1)"))&&(F(G("((i19.i0.i1.u300.p2016!=1)||(i19.i0.i1.u305.p2044!=1))"))))))
Formula 0 simplified : F(G!"(i24.u379.p2537!=1)" | GF!"((i19.i0.i1.u300.p2016!=1)||(i19.i0.i1.u305.p2044!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3411761481170848230
[2024-05-29 01:33:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3411761481170848230
Running compilation step : cd /tmp/ltsmin3411761481170848230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2274 ms.
Running link step : cd /tmp/ltsmin3411761481170848230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3411761481170848230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-12 finished in 83485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2657 transition count 2357
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2407 transition count 2357
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2407 transition count 2106
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2156 transition count 2106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1007 place count 2151 transition count 2101
Iterating global reduction 2 with 5 rules applied. Total rules applied 1012 place count 2151 transition count 2101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1012 place count 2151 transition count 2098
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1018 place count 2148 transition count 2098
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 3 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 2806 place count 1254 transition count 1204
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2808 place count 1252 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2809 place count 1251 transition count 1202
Applied a total of 2809 rules in 471 ms. Remains 1251 /2658 variables (removed 1407) and now considering 1202/2608 (removed 1406) transitions.
// Phase 1: matrix 1202 rows 1251 cols
[2024-05-29 01:33:34] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:33:35] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-29 01:33:35] [INFO ] Invariant cache hit.
[2024-05-29 01:33:37] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
[2024-05-29 01:33:37] [INFO ] Redundant transitions in 144 ms returned [1201]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-29 01:33:37] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:33:37] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/2658 places, 1201/2608 transitions.
Applied a total of 0 rules in 37 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3562 ms. Remains : 1251/2658 places, 1201/2608 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-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:(EQ s349 0)], 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 38 reset in 1016 ms.
Product exploration explored 100000 steps with 39 reset in 1222 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1251 stabilizing places and 2/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 41 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-29 01:33:40] [INFO ] Invariant cache hit.
[2024-05-29 01:33:41] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-29 01:33:41] [INFO ] Invariant cache hit.
[2024-05-29 01:33:42] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
[2024-05-29 01:33:43] [INFO ] Redundant transitions in 147 ms returned []
[2024-05-29 01:33:43] [INFO ] Invariant cache hit.
[2024-05-29 01:33:43] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3029 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1251 stabilizing places and 2/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 1003 ms.
Product exploration explored 100000 steps with 39 reset in 1192 ms.
Built C files in :
/tmp/ltsmin16947740227831695376
[2024-05-29 01:33:46] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2024-05-29 01:33:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:33:46] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2024-05-29 01:33:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:33:46] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2024-05-29 01:33:46] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:33:46] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16947740227831695376
Running compilation step : cd /tmp/ltsmin16947740227831695376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16947740227831695376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16947740227831695376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 32 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-29 01:33:49] [INFO ] Invariant cache hit.
[2024-05-29 01:33:50] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-29 01:33:50] [INFO ] Invariant cache hit.
[2024-05-29 01:33:52] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
[2024-05-29 01:33:52] [INFO ] Redundant transitions in 146 ms returned []
[2024-05-29 01:33:52] [INFO ] Invariant cache hit.
[2024-05-29 01:33:52] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3134 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Built C files in :
/tmp/ltsmin788173143562039061
[2024-05-29 01:33:52] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2024-05-29 01:33:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:33:52] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2024-05-29 01:33:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:33:53] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2024-05-29 01:33:53] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:33:53] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin788173143562039061
Running compilation step : cd /tmp/ltsmin788173143562039061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin788173143562039061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin788173143562039061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:33:56] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:33:56] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:33:56] [INFO ] Time to serialize gal into /tmp/LTL16758609646960704976.gal : 6 ms
[2024-05-29 01:33:56] [INFO ] Time to serialize properties into /tmp/LTL15702741626108859921.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16758609646960704976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3008677179352375070.hoa' '-atoms' '/tmp/LTL15702741626108859921.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15702741626108859921.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3008677179352375070.hoa
Detected timeout of ITS tools.
[2024-05-29 01:34:11] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:34:11] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:34:11] [INFO ] Time to serialize gal into /tmp/LTL17462080052992705065.gal : 6 ms
[2024-05-29 01:34:11] [INFO ] Time to serialize properties into /tmp/LTL11782466362046979398.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17462080052992705065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11782466362046979398.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p867==0)"))))
Formula 0 simplified : GF!"(p867==0)"
Detected timeout of ITS tools.
[2024-05-29 01:34:26] [INFO ] Flatten gal took : 37 ms
[2024-05-29 01:34:26] [INFO ] Applying decomposition
[2024-05-29 01:34:26] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2120786723936084039.txt' '-o' '/tmp/graph2120786723936084039.bin' '-w' '/tmp/graph2120786723936084039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2120786723936084039.bin' '-l' '-1' '-v' '-w' '/tmp/graph2120786723936084039.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:34:26] [INFO ] Decomposing Gal with order
[2024-05-29 01:34:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:34:26] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-29 01:34:26] [INFO ] Flatten gal took : 58 ms
[2024-05-29 01:34:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 592 labels/synchronizations in 6 ms.
[2024-05-29 01:34:26] [INFO ] Time to serialize gal into /tmp/LTL17245687654289843766.gal : 7 ms
[2024-05-29 01:34:26] [INFO ] Time to serialize properties into /tmp/LTL17017512789901219904.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17245687654289843766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17017512789901219904.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i8.u126.p867==0)"))))
Formula 0 simplified : GF!"(i8.u126.p867==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4776929022602122092
[2024-05-29 01:34:41] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4776929022602122092
Running compilation step : cd /tmp/ltsmin4776929022602122092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2368 ms.
Running link step : cd /tmp/ltsmin4776929022602122092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4776929022602122092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-13 finished in 82710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(G(p1)&&X(p2))))))'
Support contains 5 out of 2658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2657 transition count 2356
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2406 transition count 2356
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2406 transition count 2105
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2155 transition count 2105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1010 place count 2149 transition count 2099
Iterating global reduction 2 with 6 rules applied. Total rules applied 1016 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1016 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1024 place count 2145 transition count 2095
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2808 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2810 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2811 place count 1250 transition count 1201
Applied a total of 2811 rules in 450 ms. Remains 1250 /2658 variables (removed 1408) and now considering 1201/2608 (removed 1407) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-29 01:34:57] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:34:58] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-29 01:34:58] [INFO ] Invariant cache hit.
[2024-05-29 01:34:59] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
[2024-05-29 01:34:59] [INFO ] Redundant transitions in 141 ms returned [1200]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-29 01:34:59] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:35:00] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/2658 places, 1200/2608 transitions.
Applied a total of 0 rules in 36 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3429 ms. Remains : 1250/2658 places, 1200/2608 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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 : ShieldIIPs-PT-050B-LTLFireability-14 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) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s897 0), p1:(EQ s1 1), p2:(AND (EQ s213 1) (EQ s222 1) (EQ s226 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 126 reset in 938 ms.
Product exploration explored 100000 steps with 130 reset in 1184 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 01:35:03] [INFO ] Invariant cache hit.
[2024-05-29 01:35:03] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 01:35:04] [INFO ] [Nat]Absence check using 450 positive place invariants in 73 ms returned sat
[2024-05-29 01:35:04] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 01:35:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-29 01:35:04] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 01:35:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2024-05-29 01:35:05] [INFO ] After 1066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-29 01:35:05] [INFO ] After 1511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 73 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 0 with 295 rules applied. Total rules applied 295 place count 1250 transition count 1200
Applied a total of 295 rules in 60 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 200666 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 200666 steps, saw 197802 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-29 01:35:08] [INFO ] Computed 450 invariants in 11 ms
[2024-05-29 01:35:08] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:35:09] [INFO ] [Nat]Absence check using 450 positive place invariants in 75 ms returned sat
[2024-05-29 01:35:09] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:35:09] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 01:35:10] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:35:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2024-05-29 01:35:10] [INFO ] After 870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-29 01:35:10] [INFO ] After 1178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 233152 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233152 steps, saw 229607 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:35:13] [INFO ] Invariant cache hit.
[2024-05-29 01:35:13] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:35:13] [INFO ] [Nat]Absence check using 450 positive place invariants in 74 ms returned sat
[2024-05-29 01:35:14] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:35:14] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:35:14] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-29 01:35:14] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-29 01:35:14] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 01:35:14] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:35:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 01:35:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 578 ms
[2024-05-29 01:35:15] [INFO ] After 1184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-29 01:35:15] [INFO ] After 1478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-29 01:35:15] [INFO ] Invariant cache hit.
[2024-05-29 01:35:15] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-05-29 01:35:15] [INFO ] Invariant cache hit.
[2024-05-29 01:35:17] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2024-05-29 01:35:17] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-29 01:35:17] [INFO ] Invariant cache hit.
[2024-05-29 01:35:18] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3324 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 01:35:18] [INFO ] Invariant cache hit.
[2024-05-29 01:35:18] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:35:18] [INFO ] [Nat]Absence check using 450 positive place invariants in 80 ms returned sat
[2024-05-29 01:35:19] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:35:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2024-05-29 01:35:19] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2024-05-29 01:35:19] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 01:35:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 01:35:19] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:35:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:35:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 598 ms
[2024-05-29 01:35:20] [INFO ] After 1231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 01:35:20] [INFO ] After 1532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 38 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-29 01:35:20] [INFO ] Computed 450 invariants in 6 ms
[2024-05-29 01:35:21] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-29 01:35:21] [INFO ] Invariant cache hit.
[2024-05-29 01:35:22] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
[2024-05-29 01:35:23] [INFO ] Redundant transitions in 135 ms returned []
[2024-05-29 01:35:23] [INFO ] Invariant cache hit.
[2024-05-29 01:35:23] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2938 ms. Remains : 1250/1250 places, 1200/1200 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 01:35:24] [INFO ] Invariant cache hit.
[2024-05-29 01:35:24] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 01:35:25] [INFO ] [Nat]Absence check using 450 positive place invariants in 78 ms returned sat
[2024-05-29 01:35:25] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 01:35:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
[2024-05-29 01:35:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-29 01:35:26] [INFO ] After 1040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-29 01:35:26] [INFO ] After 1521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 166 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 0 with 295 rules applied. Total rules applied 295 place count 1250 transition count 1200
Applied a total of 295 rules in 72 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 198657 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 198657 steps, saw 195834 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-29 01:35:30] [INFO ] Computed 450 invariants in 12 ms
[2024-05-29 01:35:30] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:35:30] [INFO ] [Nat]Absence check using 450 positive place invariants in 76 ms returned sat
[2024-05-29 01:35:31] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:35:31] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-29 01:35:31] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:35:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2024-05-29 01:35:31] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-29 01:35:31] [INFO ] After 1178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 38 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 237977 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237977 steps, saw 234327 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:35:34] [INFO ] Invariant cache hit.
[2024-05-29 01:35:35] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:35:35] [INFO ] [Nat]Absence check using 450 positive place invariants in 77 ms returned sat
[2024-05-29 01:35:35] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:35:35] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-29 01:35:36] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:35:36] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 01:35:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 01:35:36] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:35:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 01:35:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 608 ms
[2024-05-29 01:35:36] [INFO ] After 1226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-29 01:35:36] [INFO ] After 1537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 35 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-29 01:35:36] [INFO ] Invariant cache hit.
[2024-05-29 01:35:37] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-29 01:35:37] [INFO ] Invariant cache hit.
[2024-05-29 01:35:39] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
[2024-05-29 01:35:39] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 01:35:39] [INFO ] Invariant cache hit.
[2024-05-29 01:35:39] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3335 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 01:35:39] [INFO ] Invariant cache hit.
[2024-05-29 01:35:40] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:35:40] [INFO ] [Nat]Absence check using 450 positive place invariants in 79 ms returned sat
[2024-05-29 01:35:40] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:35:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 607 ms
[2024-05-29 01:35:41] [INFO ] After 1210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-29 01:35:41] [INFO ] After 1521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 319 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 133 reset in 1001 ms.
Product exploration explored 100000 steps with 136 reset in 1184 ms.
Built C files in :
/tmp/ltsmin15691937814232034908
[2024-05-29 01:35:44] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-29 01:35:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:35:44] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-29 01:35:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:35:45] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-29 01:35:45] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:35:45] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15691937814232034908
Running compilation step : cd /tmp/ltsmin15691937814232034908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15691937814232034908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15691937814232034908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 42 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-29 01:35:48] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:35:48] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-29 01:35:48] [INFO ] Invariant cache hit.
[2024-05-29 01:35:50] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
[2024-05-29 01:35:50] [INFO ] Redundant transitions in 138 ms returned []
[2024-05-29 01:35:50] [INFO ] Invariant cache hit.
[2024-05-29 01:35:51] [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 2982 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Built C files in :
/tmp/ltsmin16055573994460008153
[2024-05-29 01:35:51] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-29 01:35:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:35:51] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-29 01:35:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:35:51] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-29 01:35:51] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:35:51] [INFO ] Built C files in 238ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16055573994460008153
Running compilation step : cd /tmp/ltsmin16055573994460008153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16055573994460008153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16055573994460008153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:35:54] [INFO ] Flatten gal took : 42 ms
[2024-05-29 01:35:54] [INFO ] Flatten gal took : 36 ms
[2024-05-29 01:35:54] [INFO ] Time to serialize gal into /tmp/LTL8790396029347169305.gal : 6 ms
[2024-05-29 01:35:54] [INFO ] Time to serialize properties into /tmp/LTL7147141942119413896.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8790396029347169305.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10041482151319553293.hoa' '-atoms' '/tmp/LTL7147141942119413896.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7147141942119413896.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10041482151319553293.hoa
Detected timeout of ITS tools.
[2024-05-29 01:36:09] [INFO ] Flatten gal took : 34 ms
[2024-05-29 01:36:09] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:36:09] [INFO ] Time to serialize gal into /tmp/LTL17631763846378781864.gal : 6 ms
[2024-05-29 01:36:09] [INFO ] Time to serialize properties into /tmp/LTL12832942144059674063.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17631763846378781864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12832942144059674063.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(p2160==0)")))||((G("(p51==1)"))&&(X("(((p548==1)&&(p567==1))&&(p578==1))")))))))
Formula 0 simplified : FG(!"(p2160==0)" & (F!"(p51==1)" | X!"(((p548==1)&&(p567==1))&&(p578==1))"))
Detected timeout of ITS tools.
[2024-05-29 01:36:24] [INFO ] Flatten gal took : 34 ms
[2024-05-29 01:36:24] [INFO ] Applying decomposition
[2024-05-29 01:36:24] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8666720157512901454.txt' '-o' '/tmp/graph8666720157512901454.bin' '-w' '/tmp/graph8666720157512901454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8666720157512901454.bin' '-l' '-1' '-v' '-w' '/tmp/graph8666720157512901454.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:36:24] [INFO ] Decomposing Gal with order
[2024-05-29 01:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:36:24] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-29 01:36:24] [INFO ] Flatten gal took : 52 ms
[2024-05-29 01:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 6 ms.
[2024-05-29 01:36:24] [INFO ] Time to serialize gal into /tmp/LTL11651308951585170418.gal : 7 ms
[2024-05-29 01:36:24] [INFO ] Time to serialize properties into /tmp/LTL15669307962158357446.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11651308951585170418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15669307962158357446.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(i19.u323.p2160==0)")))||((G("(i0.u0.p51==1)"))&&(X("(((i4.u77.p548==1)&&(i4.u80.p567==1))&&(i4.u81.p578==1))")))))))
Formula 0 simplified : FG(!"(i19.u323.p2160==0)" & (F!"(i0.u0.p51==1)" | X!"(((i4.u77.p548==1)&&(i4.u80.p567==1))&&(i4.u81.p578==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2160616913613167037
[2024-05-29 01:36:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2160616913613167037
Running compilation step : cd /tmp/ltsmin2160616913613167037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2292 ms.
Running link step : cd /tmp/ltsmin2160616913613167037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2160616913613167037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](<>((LTLAPp0==true)))||([]((LTLAPp1==true))&&X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-14 finished in 118001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-050B-LTLFireability-01
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2657 transition count 2357
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2407 transition count 2357
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2407 transition count 2106
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2156 transition count 2106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1007 place count 2151 transition count 2101
Iterating global reduction 2 with 5 rules applied. Total rules applied 1012 place count 2151 transition count 2101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1012 place count 2151 transition count 2098
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1018 place count 2148 transition count 2098
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2804 place count 1255 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2806 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 1252 transition count 1203
Applied a total of 2807 rules in 419 ms. Remains 1252 /2658 variables (removed 1406) and now considering 1203/2608 (removed 1405) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2024-05-29 01:36:55] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:36:56] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-29 01:36:56] [INFO ] Invariant cache hit.
[2024-05-29 01:36:57] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2024-05-29 01:36:57] [INFO ] Invariant cache hit.
[2024-05-29 01:36:58] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1252/2658 places, 1203/2608 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3017 ms. Remains : 1252/2658 places, 1203/2608 transitions.
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s394 0), p0:(OR (EQ s1084 0) (EQ s1100 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 38 reset in 1012 ms.
Product exploration explored 100000 steps with 38 reset in 1185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1635 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Applied a total of 0 rules in 42 ms. Remains 1252 /1252 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-29 01:37:01] [INFO ] Invariant cache hit.
[2024-05-29 01:37:01] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-29 01:37:01] [INFO ] Invariant cache hit.
[2024-05-29 01:37:03] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2024-05-29 01:37:03] [INFO ] Redundant transitions in 126 ms returned [1202]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2024-05-29 01:37:03] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:37:03] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/1252 places, 1202/1203 transitions.
Applied a total of 0 rules in 30 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2859 ms. Remains : 1252/1252 places, 1202/1203 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1613 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 39 reset in 942 ms.
Product exploration explored 100000 steps with 39 reset in 1179 ms.
Built C files in :
/tmp/ltsmin15190308306580125384
[2024-05-29 01:37:06] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-29 01:37:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:37:06] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-29 01:37:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:37:06] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-29 01:37:06] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:37:06] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15190308306580125384
Running compilation step : cd /tmp/ltsmin15190308306580125384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15190308306580125384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15190308306580125384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 35 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-29 01:37:09] [INFO ] Invariant cache hit.
[2024-05-29 01:37:10] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-29 01:37:10] [INFO ] Invariant cache hit.
[2024-05-29 01:37:11] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2024-05-29 01:37:12] [INFO ] Redundant transitions in 131 ms returned []
[2024-05-29 01:37:12] [INFO ] Invariant cache hit.
[2024-05-29 01:37:12] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2847 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Built C files in :
/tmp/ltsmin1355224798194202276
[2024-05-29 01:37:12] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-29 01:37:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:37:12] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-29 01:37:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:37:12] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-29 01:37:12] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:37:12] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1355224798194202276
Running compilation step : cd /tmp/ltsmin1355224798194202276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1355224798194202276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1355224798194202276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:37:16] [INFO ] Flatten gal took : 33 ms
[2024-05-29 01:37:16] [INFO ] Flatten gal took : 34 ms
[2024-05-29 01:37:16] [INFO ] Time to serialize gal into /tmp/LTL7891285813100183489.gal : 6 ms
[2024-05-29 01:37:16] [INFO ] Time to serialize properties into /tmp/LTL14448043384737188819.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7891285813100183489.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13173294450453506213.hoa' '-atoms' '/tmp/LTL14448043384737188819.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14448043384737188819.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13173294450453506213.hoa
Detected timeout of ITS tools.
[2024-05-29 01:37:31] [INFO ] Flatten gal took : 33 ms
[2024-05-29 01:37:31] [INFO ] Flatten gal took : 47 ms
[2024-05-29 01:37:31] [INFO ] Time to serialize gal into /tmp/LTL4286085710486957433.gal : 5 ms
[2024-05-29 01:37:31] [INFO ] Time to serialize properties into /tmp/LTL7346816143804709177.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4286085710486957433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7346816143804709177.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p2606==0)||(p2635==0))")))||(G("(p977==0)")))))
Formula 0 simplified : X(GF!"((p2606==0)||(p2635==0))" & F!"(p977==0)")
Detected timeout of ITS tools.
[2024-05-29 01:37:46] [INFO ] Flatten gal took : 36 ms
[2024-05-29 01:37:46] [INFO ] Applying decomposition
[2024-05-29 01:37:46] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17084819084427516935.txt' '-o' '/tmp/graph17084819084427516935.bin' '-w' '/tmp/graph17084819084427516935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17084819084427516935.bin' '-l' '-1' '-v' '-w' '/tmp/graph17084819084427516935.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:37:46] [INFO ] Decomposing Gal with order
[2024-05-29 01:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:37:46] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 01:37:46] [INFO ] Flatten gal took : 49 ms
[2024-05-29 01:37:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 11 ms.
[2024-05-29 01:37:46] [INFO ] Time to serialize gal into /tmp/LTL5169667821947897351.gal : 8 ms
[2024-05-29 01:37:46] [INFO ] Time to serialize properties into /tmp/LTL18017107226065253827.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5169667821947897351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18017107226065253827.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i24.u390.p2606==0)||(i24.u396.p2635==0))")))||(G("(i9.u143.p977==0)")))))
Formula 0 simplified : X(GF!"((i24.u390.p2606==0)||(i24.u396.p2635==0))" & F!"(i9.u143.p977==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11698464345676303161
[2024-05-29 01:38:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11698464345676303161
Running compilation step : cd /tmp/ltsmin11698464345676303161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2245 ms.
Running link step : cd /tmp/ltsmin11698464345676303161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11698464345676303161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-01 finished in 81699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : ShieldIIPs-PT-050B-LTLFireability-05
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2657 transition count 2356
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2406 transition count 2356
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2406 transition count 2105
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2155 transition count 2105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1010 place count 2149 transition count 2099
Iterating global reduction 2 with 6 rules applied. Total rules applied 1016 place count 2149 transition count 2099
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1016 place count 2149 transition count 2095
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1024 place count 2145 transition count 2095
Performed 889 Post agglomeration using F-continuation condition.Transition count delta: 889
Deduced a syphon composed of 889 places in 3 ms
Reduce places removed 889 places and 0 transitions.
Iterating global reduction 2 with 1778 rules applied. Total rules applied 2802 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2804 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2805 place count 1253 transition count 1204
Applied a total of 2805 rules in 439 ms. Remains 1253 /2658 variables (removed 1405) and now considering 1204/2608 (removed 1404) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-05-29 01:38:17] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 01:38:18] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-29 01:38:18] [INFO ] Invariant cache hit.
[2024-05-29 01:38:19] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2024-05-29 01:38:19] [INFO ] Invariant cache hit.
[2024-05-29 01:38:20] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1253/2658 places, 1204/2608 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3227 ms. Remains : 1253/2658 places, 1204/2608 transitions.
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s614 1), p0:(EQ s991 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, null][false, false, false]]
Product exploration explored 100000 steps with 22590 reset in 1005 ms.
Product exploration explored 100000 steps with 22619 reset in 1231 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 474 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 584 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 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
[2024-05-29 01:38:23] [INFO ] Invariant cache hit.
[2024-05-29 01:38:24] [INFO ] [Real]Absence check using 450 positive place invariants in 289 ms returned sat
[2024-05-29 01:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:38:28] [INFO ] [Real]Absence check using state equation in 3646 ms returned sat
[2024-05-29 01:38:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:38:29] [INFO ] [Nat]Absence check using 450 positive place invariants in 302 ms returned sat
[2024-05-29 01:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:38:32] [INFO ] [Nat]Absence check using state equation in 2985 ms returned sat
[2024-05-29 01:38:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:38:32] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 01:38:33] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 01:38:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 01:38:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 523 ms
[2024-05-29 01:38:33] [INFO ] Computed and/alt/rep : 1197/2994/1197 causal constraints (skipped 4 transitions) in 68 ms.
[2024-05-29 01:38:44] [INFO ] Deduced a trap composed of 2 places in 710 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
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:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:38:44] [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 p1)
Could not prove EG (NOT p1)
Support contains 1 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1204/1204 transitions.
Applied a total of 0 rules in 32 ms. Remains 1253 /1253 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-05-29 01:38:44] [INFO ] Invariant cache hit.
[2024-05-29 01:38:45] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-29 01:38:45] [INFO ] Invariant cache hit.
[2024-05-29 01:38:46] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2024-05-29 01:38:46] [INFO ] Redundant transitions in 142 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-29 01:38:46] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 01:38:47] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1203/1204 transitions.
Applied a total of 0 rules in 31 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2999 ms. Remains : 1253/1253 places, 1203/1204 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 178 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 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2024-05-29 01:38:47] [INFO ] Invariant cache hit.
[2024-05-29 01:38:48] [INFO ] [Real]Absence check using 450 positive place invariants in 286 ms returned sat
[2024-05-29 01:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:38:51] [INFO ] [Real]Absence check using state equation in 2993 ms returned sat
[2024-05-29 01:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:38:53] [INFO ] [Nat]Absence check using 450 positive place invariants in 309 ms returned sat
[2024-05-29 01:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:38:56] [INFO ] [Nat]Absence check using state equation in 3486 ms returned sat
[2024-05-29 01:38:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 01:38:56] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:38:56] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 01:38:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2024-05-29 01:38:57] [INFO ] Computed and/alt/rep : 1196/2989/1196 causal constraints (skipped 4 transitions) in 73 ms.
[2024-05-29 01:39:07] [INFO ] Added : 465 causal constraints over 93 iterations in 10016 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22800 reset in 1066 ms.
Product exploration explored 100000 steps with 22810 reset in 1265 ms.
Built C files in :
/tmp/ltsmin13195622366352477899
[2024-05-29 01:39:09] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-29 01:39:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:39:09] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-29 01:39:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:39:09] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-29 01:39:09] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:39:09] [INFO ] Built C files in 269ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13195622366352477899
Running compilation step : cd /tmp/ltsmin13195622366352477899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13195622366352477899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13195622366352477899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1251 transition count 1201
Applied a total of 1 rules in 67 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-29 01:39:12] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:39:13] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-29 01:39:13] [INFO ] Invariant cache hit.
[2024-05-29 01:39:14] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2024-05-29 01:39:15] [INFO ] Redundant transitions in 146 ms returned []
[2024-05-29 01:39:15] [INFO ] Invariant cache hit.
[2024-05-29 01:39:15] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/1253 places, 1201/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3110 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Built C files in :
/tmp/ltsmin6156998890357569993
[2024-05-29 01:39:15] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2024-05-29 01:39:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:39:15] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2024-05-29 01:39:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:39:16] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2024-05-29 01:39:16] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:39:16] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6156998890357569993
Running compilation step : cd /tmp/ltsmin6156998890357569993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6156998890357569993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6156998890357569993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:39:19] [INFO ] Flatten gal took : 45 ms
[2024-05-29 01:39:19] [INFO ] Flatten gal took : 46 ms
[2024-05-29 01:39:19] [INFO ] Time to serialize gal into /tmp/LTL18338710006553702060.gal : 6 ms
[2024-05-29 01:39:19] [INFO ] Time to serialize properties into /tmp/LTL11768770306595106477.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18338710006553702060.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17538451757276323747.hoa' '-atoms' '/tmp/LTL11768770306595106477.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11768770306595106477.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17538451757276323747.hoa
Detected timeout of ITS tools.
[2024-05-29 01:39:34] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:39:34] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:39:34] [INFO ] Time to serialize gal into /tmp/LTL1371318094857424685.gal : 6 ms
[2024-05-29 01:39:34] [INFO ] Time to serialize properties into /tmp/LTL18099670575026807767.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1371318094857424685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18099670575026807767.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(p2378==1)"))||(X(F("(p1493==1)")))))
Formula 0 simplified : F!"(p2378==1)" & XG!"(p1493==1)"
Detected timeout of ITS tools.
[2024-05-29 01:39:49] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:39:49] [INFO ] Applying decomposition
[2024-05-29 01:39:49] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14482377218882884200.txt' '-o' '/tmp/graph14482377218882884200.bin' '-w' '/tmp/graph14482377218882884200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14482377218882884200.bin' '-l' '-1' '-v' '-w' '/tmp/graph14482377218882884200.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:39:49] [INFO ] Decomposing Gal with order
[2024-05-29 01:39:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:39:49] [INFO ] Removed a total of 799 redundant transitions.
[2024-05-29 01:39:49] [INFO ] Flatten gal took : 59 ms
[2024-05-29 01:39:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 728 labels/synchronizations in 11 ms.
[2024-05-29 01:39:49] [INFO ] Time to serialize gal into /tmp/LTL14055521633467128430.gal : 9 ms
[2024-05-29 01:39:49] [INFO ] Time to serialize properties into /tmp/LTL13956515555595461653.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14055521633467128430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13956515555595461653.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G("(i21.u358.p2378==1)"))||(X(F("(i13.u222.p1493==1)")))))
Formula 0 simplified : F!"(i21.u358.p2378==1)" & XG!"(i13.u222.p1493==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1909514441287629578
[2024-05-29 01:40:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1909514441287629578
Running compilation step : cd /tmp/ltsmin1909514441287629578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2316 ms.
Running link step : cd /tmp/ltsmin1909514441287629578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1909514441287629578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-05 finished in 123078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-050B-LTLFireability-06
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 3 out of 2658 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2658/2658 places, 2608/2608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 2657 transition count 2358
Reduce places removed 249 places and 0 transitions.
Iterating post reduction 1 with 249 rules applied. Total rules applied 498 place count 2408 transition count 2358
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 498 place count 2408 transition count 2108
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 998 place count 2158 transition count 2108
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1004 place count 2152 transition count 2102
Iterating global reduction 2 with 6 rules applied. Total rules applied 1010 place count 2152 transition count 2102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1010 place count 2152 transition count 2098
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1018 place count 2148 transition count 2098
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 4 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2802 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2804 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2805 place count 1253 transition count 1204
Applied a total of 2805 rules in 485 ms. Remains 1253 /2658 variables (removed 1405) and now considering 1204/2608 (removed 1404) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2024-05-29 01:40:20] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 01:40:21] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-29 01:40:21] [INFO ] Invariant cache hit.
[2024-05-29 01:40:22] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2024-05-29 01:40:22] [INFO ] Invariant cache hit.
[2024-05-29 01:40:23] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1253/2658 places, 1204/2608 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3206 ms. Remains : 1253/2658 places, 1204/2608 transitions.
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1030 1), p1:(AND (EQ s958 1) (EQ s974 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 240 reset in 891 ms.
Product exploration explored 100000 steps with 253 reset in 1125 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Finished random walk after 517 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
[2024-05-29 01:40:26] [INFO ] Invariant cache hit.
[2024-05-29 01:40:27] [INFO ] [Real]Absence check using 450 positive place invariants in 281 ms returned sat
[2024-05-29 01:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:40:30] [INFO ] [Real]Absence check using state equation in 2727 ms returned sat
[2024-05-29 01:40:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:40:31] [INFO ] [Nat]Absence check using 450 positive place invariants in 288 ms returned sat
[2024-05-29 01:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:40:34] [INFO ] [Nat]Absence check using state equation in 2969 ms returned sat
[2024-05-29 01:40:34] [INFO ] Computed and/alt/rep : 1201/3001/1201 causal constraints (skipped 0 transitions) in 80 ms.
[2024-05-29 01:40:46] [INFO ] Deduced a trap composed of 2 places in 687 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:40:46] [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 p1)
Could not prove EG (NOT p1)
[2024-05-29 01:40:46] [INFO ] Invariant cache hit.
[2024-05-29 01:40:47] [INFO ] [Real]Absence check using 450 positive place invariants in 290 ms returned sat
[2024-05-29 01:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:40:51] [INFO ] [Real]Absence check using state equation in 3822 ms returned sat
[2024-05-29 01:40:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:40:52] [INFO ] [Nat]Absence check using 450 positive place invariants in 281 ms returned sat
[2024-05-29 01:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:40:55] [INFO ] [Nat]Absence check using state equation in 3076 ms returned sat
[2024-05-29 01:40:55] [INFO ] Computed and/alt/rep : 1201/3001/1201 causal constraints (skipped 0 transitions) in 74 ms.
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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:41:06] [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)
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1204/1204 transitions.
Applied a total of 0 rules in 29 ms. Remains 1253 /1253 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-05-29 01:41:06] [INFO ] Invariant cache hit.
[2024-05-29 01:41:06] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-29 01:41:06] [INFO ] Invariant cache hit.
[2024-05-29 01:41:08] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2024-05-29 01:41:08] [INFO ] Redundant transitions in 139 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-29 01:41:08] [INFO ] Computed 450 invariants in 2 ms
[2024-05-29 01:41:09] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1203/1204 transitions.
Applied a total of 0 rules in 30 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2875 ms. Remains : 1253/1253 places, 1203/1204 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Finished random walk after 5824 steps, including 2 resets, run visited all 4 properties in 72 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p0), (F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
[2024-05-29 01:41:10] [INFO ] Invariant cache hit.
[2024-05-29 01:41:11] [INFO ] [Real]Absence check using 450 positive place invariants in 271 ms returned sat
[2024-05-29 01:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:41:15] [INFO ] [Real]Absence check using state equation in 3713 ms returned sat
[2024-05-29 01:41:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:41:16] [INFO ] [Nat]Absence check using 450 positive place invariants in 276 ms returned sat
[2024-05-29 01:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:41:19] [INFO ] [Nat]Absence check using state equation in 3260 ms returned sat
[2024-05-29 01:41:20] [INFO ] Computed and/alt/rep : 1200/2996/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2024-05-29 01:41:30] [INFO ] Added : 480 causal constraints over 96 iterations in 10507 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-29 01:41:30] [INFO ] Invariant cache hit.
[2024-05-29 01:41:31] [INFO ] [Real]Absence check using 450 positive place invariants in 292 ms returned sat
[2024-05-29 01:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 01:41:35] [INFO ] [Real]Absence check using state equation in 3557 ms returned sat
[2024-05-29 01:41:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 01:41:36] [INFO ] [Nat]Absence check using 450 positive place invariants in 291 ms returned sat
[2024-05-29 01:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 01:41:40] [INFO ] [Nat]Absence check using state equation in 3823 ms returned sat
[2024-05-29 01:41:40] [INFO ] Computed and/alt/rep : 1200/2996/1200 causal constraints (skipped 0 transitions) in 79 ms.
[2024-05-29 01:41:50] [INFO ] Deduced a trap composed of 2 places in 715 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 01:41:50] [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 218 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), false, false]
Product exploration explored 100000 steps with 315 reset in 934 ms.
Product exploration explored 100000 steps with 314 reset in 1200 ms.
Built C files in :
/tmp/ltsmin9716329437593167263
[2024-05-29 01:41:53] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-29 01:41:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:41:53] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-29 01:41:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:41:53] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-29 01:41:53] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:41:53] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9716329437593167263
Running compilation step : cd /tmp/ltsmin9716329437593167263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9716329437593167263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9716329437593167263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 47 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-29 01:41:56] [INFO ] Invariant cache hit.
[2024-05-29 01:41:57] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-29 01:41:57] [INFO ] Invariant cache hit.
[2024-05-29 01:41:58] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2024-05-29 01:41:58] [INFO ] Redundant transitions in 144 ms returned []
[2024-05-29 01:41:58] [INFO ] Invariant cache hit.
[2024-05-29 01:41:59] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3010 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Built C files in :
/tmp/ltsmin17951972136254017634
[2024-05-29 01:41:59] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-29 01:41:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:41:59] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-29 01:41:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:41:59] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-29 01:41:59] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:41:59] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17951972136254017634
Running compilation step : cd /tmp/ltsmin17951972136254017634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17951972136254017634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17951972136254017634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 01:42:02] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:42:02] [INFO ] Flatten gal took : 34 ms
[2024-05-29 01:42:02] [INFO ] Time to serialize gal into /tmp/LTL2705219487572168396.gal : 5 ms
[2024-05-29 01:42:02] [INFO ] Time to serialize properties into /tmp/LTL10811838246589785865.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2705219487572168396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14696431520216865806.hoa' '-atoms' '/tmp/LTL10811838246589785865.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10811838246589785865.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14696431520216865806.hoa
Detected timeout of ITS tools.
[2024-05-29 01:42:18] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:42:18] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:42:18] [INFO ] Time to serialize gal into /tmp/LTL10812103926235861379.gal : 6 ms
[2024-05-29 01:42:18] [INFO ] Time to serialize properties into /tmp/LTL17090034736066120933.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10812103926235861379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17090034736066120933.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(p2470==1)"))&&(G(F("((p2311==1)&&(p2340==1))"))))))
Formula 0 simplified : X(G!"(p2470==1)" | FG!"((p2311==1)&&(p2340==1))")
Detected timeout of ITS tools.
[2024-05-29 01:42:33] [INFO ] Flatten gal took : 35 ms
[2024-05-29 01:42:33] [INFO ] Applying decomposition
[2024-05-29 01:42:33] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16966101797535684889.txt' '-o' '/tmp/graph16966101797535684889.bin' '-w' '/tmp/graph16966101797535684889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16966101797535684889.bin' '-l' '-1' '-v' '-w' '/tmp/graph16966101797535684889.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:42:33] [INFO ] Decomposing Gal with order
[2024-05-29 01:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:42:33] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 01:42:33] [INFO ] Flatten gal took : 51 ms
[2024-05-29 01:42:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 11 ms.
[2024-05-29 01:42:33] [INFO ] Time to serialize gal into /tmp/LTL4047148028301211461.gal : 14 ms
[2024-05-29 01:42:33] [INFO ] Time to serialize properties into /tmp/LTL4117271156985325588.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4047148028301211461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4117271156985325588.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("(i23.u371.p2470==1)"))&&(G(F("((i21.u346.p2311==1)&&(i21.u351.p2340==1))"))))))
Formula 0 simplified : X(G!"(i23.u371.p2470==1)" | FG!"((i21.u346.p2311==1)&&(i21.u351.p2340==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2078030940114179338
[2024-05-29 01:42:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2078030940114179338
Running compilation step : cd /tmp/ltsmin2078030940114179338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2305 ms.
Running link step : cd /tmp/ltsmin2078030940114179338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2078030940114179338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-06 finished in 163773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(G(p1)&&X(p2))))))'
[2024-05-29 01:43:04] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14383246520166292392
[2024-05-29 01:43:04] [INFO ] Too many transitions (2608) to apply POR reductions. Disabling POR matrices.
[2024-05-29 01:43:04] [INFO ] Applying decomposition
[2024-05-29 01:43:04] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14383246520166292392
Running compilation step : cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 01:43:04] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9629708321969832779.txt' '-o' '/tmp/graph9629708321969832779.bin' '-w' '/tmp/graph9629708321969832779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9629708321969832779.bin' '-l' '-1' '-v' '-w' '/tmp/graph9629708321969832779.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:43:04] [INFO ] Decomposing Gal with order
[2024-05-29 01:43:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:43:04] [INFO ] Removed a total of 1150 redundant transitions.
[2024-05-29 01:43:04] [INFO ] Flatten gal took : 91 ms
[2024-05-29 01:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 01:43:04] [INFO ] Time to serialize gal into /tmp/LTLFireability15830803378384571097.gal : 32 ms
[2024-05-29 01:43:04] [INFO ] Time to serialize properties into /tmp/LTLFireability11901872624370941016.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15830803378384571097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11901872624370941016.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 7 LTL properties
Checking formula 0 : !((X((F(G("((i43.i1.u869.p2606==0)||(i43.i3.u878.p2635==0))")))||(G("(i16.u330.p977==0)")))))
Formula 0 simplified : X(GF!"((i43.i1.u869.p2606==0)||(i43.i3.u878.p2635==0))" & F!"(i16.u330.p977==0)")
Compilation finished in 6208 ms.
Running link step : cd /tmp/ltsmin14383246520166292392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp2==true))||X(<>((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp2==true))||X(<>((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp4==true))&&[](<>((LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp4==true))&&[](<>((LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp6==true))||[]((LTLAPp7==true))||[]((LTLAPp8==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 02:10:00] [INFO ] Applying decomposition
[2024-05-29 02:10:00] [INFO ] Flatten gal took : 654 ms
[2024-05-29 02:10:01] [INFO ] Decomposing Gal with order
[2024-05-29 02:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:10:06] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-29 02:10:06] [INFO ] Flatten gal took : 516 ms
[2024-05-29 02:10:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1000 labels/synchronizations in 176 ms.
[2024-05-29 02:10:07] [INFO ] Time to serialize gal into /tmp/LTLFireability14336801276397221221.gal : 104 ms
[2024-05-29 02:10:07] [INFO ] Time to serialize properties into /tmp/LTLFireability12564251108744409228.ltl : 4 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14336801276397221221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12564251108744409228.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 7 LTL properties
Checking formula 0 : !((X((F(G("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u792.p2606==0)||(i0.i0.i0.i0.i0.i0.i1.i0.u797.p2635==0))")))||(G("(i0.i0.i0.i0....270
Formula 0 simplified : X(GF!"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u792.p2606==0)||(i0.i0.i0.i0.i0.i0.i1.i0.u797.p2635==0))" & F!"(i0.i0.i0.i0.i0.i0....260
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp6==true))||[]((LTLAPp7==true))||[]((LTLAPp8==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14383246520166292392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp9==true))&&<>([]((LTLAPp10==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5904092 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15534000 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-PT-050B, 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 r373-tall-171683788500098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B 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 ;