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-171683788500088.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-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788500088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 675K 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-040B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716942179405

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-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 00:23:01] [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 00:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:23:01] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-05-29 00:23:01] [INFO ] Transformed 2403 places.
[2024-05-29 00:23:01] [INFO ] Transformed 2363 transitions.
[2024-05-29 00:23:01] [INFO ] Found NUPN structural information;
[2024-05-29 00:23:01] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-040B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 270 place count 2133 transition count 2093
Iterating global reduction 0 with 270 rules applied. Total rules applied 540 place count 2133 transition count 2093
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 541 place count 2132 transition count 2092
Iterating global reduction 0 with 1 rules applied. Total rules applied 542 place count 2132 transition count 2092
Applied a total of 542 rules in 641 ms. Remains 2132 /2403 variables (removed 271) and now considering 2092/2363 (removed 271) transitions.
// Phase 1: matrix 2092 rows 2132 cols
[2024-05-29 00:23:02] [INFO ] Computed 361 invariants in 42 ms
[2024-05-29 00:23:03] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2024-05-29 00:23:03] [INFO ] Invariant cache hit.
[2024-05-29 00:23:05] [INFO ] Implicit Places using invariants and state equation in 2367 ms returned []
Implicit Place search using SMT with State Equation took 3435 ms to find 0 implicit places.
[2024-05-29 00:23:05] [INFO ] Invariant cache hit.
[2024-05-29 00:23:07] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2132/2403 places, 2092/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5418 ms. Remains : 2132/2403 places, 2092/2363 transitions.
Support contains 50 out of 2132 places after structural reductions.
[2024-05-29 00:23:07] [INFO ] Flatten gal took : 172 ms
[2024-05-29 00:23:07] [INFO ] Flatten gal took : 93 ms
[2024-05-29 00:23:07] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 48 out of 2132 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 31) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2024-05-29 00:23:08] [INFO ] Invariant cache hit.
[2024-05-29 00:23:09] [INFO ] [Real]Absence check using 361 positive place invariants in 135 ms returned sat
[2024-05-29 00:23:09] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 00:23:10] [INFO ] [Nat]Absence check using 361 positive place invariants in 132 ms returned sat
[2024-05-29 00:23:12] [INFO ] After 1646ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2024-05-29 00:23:12] [INFO ] Deduced a trap composed of 17 places in 480 ms of which 12 ms to minimize.
[2024-05-29 00:23:13] [INFO ] Deduced a trap composed of 24 places in 560 ms of which 2 ms to minimize.
[2024-05-29 00:23:14] [INFO ] Deduced a trap composed of 34 places in 519 ms of which 2 ms to minimize.
[2024-05-29 00:23:14] [INFO ] Deduced a trap composed of 38 places in 454 ms of which 2 ms to minimize.
[2024-05-29 00:23:15] [INFO ] Deduced a trap composed of 30 places in 498 ms of which 2 ms to minimize.
[2024-05-29 00:23:15] [INFO ] Deduced a trap composed of 24 places in 451 ms of which 1 ms to minimize.
[2024-05-29 00:23:16] [INFO ] Deduced a trap composed of 30 places in 459 ms of which 2 ms to minimize.
[2024-05-29 00:23:16] [INFO ] Deduced a trap composed of 19 places in 459 ms of which 1 ms to minimize.
[2024-05-29 00:23:17] [INFO ] Deduced a trap composed of 26 places in 444 ms of which 1 ms to minimize.
[2024-05-29 00:23:17] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 2 ms to minimize.
[2024-05-29 00:23:18] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 1 ms to minimize.
[2024-05-29 00:23:18] [INFO ] Deduced a trap composed of 24 places in 429 ms of which 2 ms to minimize.
[2024-05-29 00:23:19] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 1 ms to minimize.
[2024-05-29 00:23:19] [INFO ] Deduced a trap composed of 30 places in 414 ms of which 1 ms to minimize.
[2024-05-29 00:23:20] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 2 ms to minimize.
[2024-05-29 00:23:20] [INFO ] Deduced a trap composed of 15 places in 403 ms of which 1 ms to minimize.
[2024-05-29 00:23:21] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 1 ms to minimize.
[2024-05-29 00:23:21] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 1 ms to minimize.
[2024-05-29 00:23:22] [INFO ] Deduced a trap composed of 51 places in 419 ms of which 1 ms to minimize.
[2024-05-29 00:23:22] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2024-05-29 00:23:23] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 1 ms to minimize.
[2024-05-29 00:23:23] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 1 ms to minimize.
[2024-05-29 00:23:23] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 1 ms to minimize.
[2024-05-29 00:23:24] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 1 ms to minimize.
[2024-05-29 00:23:24] [INFO ] Deduced a trap composed of 39 places in 348 ms of which 1 ms to minimize.
[2024-05-29 00:23:25] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 0 ms to minimize.
[2024-05-29 00:23:25] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 1 ms to minimize.
[2024-05-29 00:23:26] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2024-05-29 00:23:26] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 1 ms to minimize.
[2024-05-29 00:23:26] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 1 ms to minimize.
[2024-05-29 00:23:27] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 0 ms to minimize.
[2024-05-29 00:23:27] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 1 ms to minimize.
[2024-05-29 00:23:27] [INFO ] Deduced a trap composed of 53 places in 283 ms of which 1 ms to minimize.
[2024-05-29 00:23:28] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 3 ms to minimize.
[2024-05-29 00:23:28] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 1 ms to minimize.
[2024-05-29 00:23:28] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 1 ms to minimize.
[2024-05-29 00:23:29] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 0 ms to minimize.
[2024-05-29 00:23:29] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 0 ms to minimize.
[2024-05-29 00:23:29] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 0 ms to minimize.
[2024-05-29 00:23:29] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 1 ms to minimize.
[2024-05-29 00:23:30] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 0 ms to minimize.
[2024-05-29 00:23:30] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 17975 ms
[2024-05-29 00:23:30] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2024-05-29 00:23:31] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 1 ms to minimize.
[2024-05-29 00:23:31] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 0 ms to minimize.
[2024-05-29 00:23:31] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 1 ms to minimize.
[2024-05-29 00:23:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1102 ms
[2024-05-29 00:23:31] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2024-05-29 00:23:32] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 0 ms to minimize.
[2024-05-29 00:23:32] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2024-05-29 00:23:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 692 ms
[2024-05-29 00:23:32] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 1 ms to minimize.
[2024-05-29 00:23:32] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2024-05-29 00:23:33] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 1 ms to minimize.
[2024-05-29 00:23:33] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 1 ms to minimize.
[2024-05-29 00:23:33] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 1 ms to minimize.
[2024-05-29 00:23:33] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 1 ms to minimize.
[2024-05-29 00:23:34] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 1 ms to minimize.
[2024-05-29 00:23:34] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2024-05-29 00:23:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1875 ms
[2024-05-29 00:23:34] [INFO ] Deduced a trap composed of 30 places in 206 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 00:23:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 00:23:34] [INFO ] After 25202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 580 ms.
Support contains 19 out of 2132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 2132 transition count 1896
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1936 transition count 1896
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 392 place count 1936 transition count 1695
Deduced a syphon composed of 201 places in 12 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 794 place count 1735 transition count 1695
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 804 place count 1725 transition count 1685
Iterating global reduction 2 with 10 rules applied. Total rules applied 814 place count 1725 transition count 1685
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 814 place count 1725 transition count 1679
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 826 place count 1719 transition count 1679
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2246 place count 1009 transition count 969
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 272 times.
Drop transitions removed 272 transitions
Iterating global reduction 2 with 272 rules applied. Total rules applied 2518 place count 1009 transition count 969
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2519 place count 1008 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2520 place count 1007 transition count 968
Applied a total of 2520 rules in 774 ms. Remains 1007 /2132 variables (removed 1125) and now considering 968/2092 (removed 1124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 774 ms. Remains : 1007/2132 places, 968/2092 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 968 rows 1007 cols
[2024-05-29 00:23:36] [INFO ] Computed 360 invariants in 37 ms
[2024-05-29 00:23:36] [INFO ] [Real]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 00:23:36] [INFO ] [Real]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:23:37] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:23:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 64 ms returned sat
[2024-05-29 00:23:37] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:23:37] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:23:37] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 00:23:37] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 00:23:38] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-29 00:23:38] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:23:38] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 00:23:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 507 ms
[2024-05-29 00:23:38] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 00:23:38] [INFO ] After 1223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 1007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 968/968 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 1007 transition count 963
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1002 transition count 963
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1001 transition count 962
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 1001 transition count 962
Applied a total of 17 rules in 228 ms. Remains 1001 /1007 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 1001/1007 places, 962/968 transitions.
Finished random walk after 9770 steps, including 2 resets, run visited all 1 properties in 112 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA ShieldIIPs-PT-040B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 489 stabilizing places and 489 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' '!(G((F((p0||G(p1)))&&X(G((p2&&X((p2 U (p3||G(p2))))))))))'
Support contains 4 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 200 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:23:39] [INFO ] Computed 361 invariants in 19 ms
[2024-05-29 00:23:40] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-29 00:23:40] [INFO ] Invariant cache hit.
[2024-05-29 00:23:42] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 3036 ms to find 0 implicit places.
[2024-05-29 00:23:42] [INFO ] Invariant cache hit.
[2024-05-29 00:23:43] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4543 ms. Remains : 2122/2132 places, 2082/2092 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 312 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s26 0), p1:(OR (EQ s531 0) (EQ s541 0) (EQ s560 0)), p2:(OR (NEQ s531 1) (NEQ s541 1) (NEQ s560 1))], 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 33331 reset in 1025 ms.
Product exploration explored 100000 steps with 33333 reset in 964 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 00:23:46] [INFO ] Invariant cache hit.
[2024-05-29 00:23:46] [INFO ] [Real]Absence check using 361 positive place invariants in 129 ms returned sat
[2024-05-29 00:23:48] [INFO ] After 1571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:23:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 125 ms returned sat
[2024-05-29 00:23:49] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-29 00:23:50] [INFO ] Deduced a trap composed of 18 places in 510 ms of which 1 ms to minimize.
[2024-05-29 00:23:50] [INFO ] Deduced a trap composed of 22 places in 493 ms of which 1 ms to minimize.
[2024-05-29 00:23:51] [INFO ] Deduced a trap composed of 18 places in 465 ms of which 1 ms to minimize.
[2024-05-29 00:23:51] [INFO ] Deduced a trap composed of 22 places in 463 ms of which 1 ms to minimize.
[2024-05-29 00:23:52] [INFO ] Deduced a trap composed of 24 places in 466 ms of which 2 ms to minimize.
[2024-05-29 00:23:52] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 1 ms to minimize.
[2024-05-29 00:23:53] [INFO ] Deduced a trap composed of 18 places in 470 ms of which 1 ms to minimize.
[2024-05-29 00:23:53] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 1 ms to minimize.
[2024-05-29 00:23:54] [INFO ] Deduced a trap composed of 32 places in 453 ms of which 1 ms to minimize.
[2024-05-29 00:23:54] [INFO ] Deduced a trap composed of 30 places in 448 ms of which 1 ms to minimize.
[2024-05-29 00:23:55] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 2 ms to minimize.
[2024-05-29 00:23:55] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 1 ms to minimize.
[2024-05-29 00:23:56] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 1 ms to minimize.
[2024-05-29 00:23:56] [INFO ] Deduced a trap composed of 23 places in 431 ms of which 1 ms to minimize.
[2024-05-29 00:23:57] [INFO ] Deduced a trap composed of 37 places in 465 ms of which 2 ms to minimize.
[2024-05-29 00:23:58] [INFO ] Deduced a trap composed of 41 places in 424 ms of which 1 ms to minimize.
[2024-05-29 00:23:58] [INFO ] Deduced a trap composed of 40 places in 430 ms of which 1 ms to minimize.
[2024-05-29 00:23:59] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 1 ms to minimize.
[2024-05-29 00:23:59] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 1 ms to minimize.
[2024-05-29 00:23:59] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2024-05-29 00:24:00] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 1 ms to minimize.
[2024-05-29 00:24:00] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 1 ms to minimize.
[2024-05-29 00:24:01] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 1 ms to minimize.
[2024-05-29 00:24:01] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 1 ms to minimize.
[2024-05-29 00:24:02] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 1 ms to minimize.
[2024-05-29 00:24:02] [INFO ] Deduced a trap composed of 55 places in 414 ms of which 1 ms to minimize.
[2024-05-29 00:24:03] [INFO ] Deduced a trap composed of 40 places in 430 ms of which 1 ms to minimize.
[2024-05-29 00:24:03] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 2 ms to minimize.
[2024-05-29 00:24:04] [INFO ] Deduced a trap composed of 47 places in 414 ms of which 1 ms to minimize.
[2024-05-29 00:24:04] [INFO ] Deduced a trap composed of 36 places in 416 ms of which 1 ms to minimize.
[2024-05-29 00:24:05] [INFO ] Deduced a trap composed of 40 places in 388 ms of which 1 ms to minimize.
[2024-05-29 00:24:05] [INFO ] Deduced a trap composed of 42 places in 450 ms of which 2 ms to minimize.
[2024-05-29 00:24:06] [INFO ] Deduced a trap composed of 24 places in 430 ms of which 1 ms to minimize.
[2024-05-29 00:24:06] [INFO ] Deduced a trap composed of 33 places in 425 ms of which 1 ms to minimize.
[2024-05-29 00:24:07] [INFO ] Deduced a trap composed of 22 places in 385 ms of which 1 ms to minimize.
[2024-05-29 00:24:07] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 1 ms to minimize.
[2024-05-29 00:24:08] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 1 ms to minimize.
[2024-05-29 00:24:08] [INFO ] Deduced a trap composed of 20 places in 383 ms of which 1 ms to minimize.
[2024-05-29 00:24:09] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 1 ms to minimize.
[2024-05-29 00:24:09] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 1 ms to minimize.
[2024-05-29 00:24:10] [INFO ] Deduced a trap composed of 41 places in 408 ms of which 1 ms to minimize.
[2024-05-29 00:24:10] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 1 ms to minimize.
[2024-05-29 00:24:11] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 1 ms to minimize.
[2024-05-29 00:24:11] [INFO ] Deduced a trap composed of 46 places in 403 ms of which 1 ms to minimize.
[2024-05-29 00:24:12] [INFO ] Deduced a trap composed of 52 places in 400 ms of which 1 ms to minimize.
[2024-05-29 00:24:12] [INFO ] Deduced a trap composed of 39 places in 407 ms of which 1 ms to minimize.
[2024-05-29 00:24:13] [INFO ] Deduced a trap composed of 51 places in 364 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.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 00:24:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 00:24:13] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 1882
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1922 transition count 1882
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1922 transition count 1681
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1721 transition count 1681
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2240 place count 1002 transition count 962
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions removed 277 transitions
Iterating global reduction 2 with 277 rules applied. Total rules applied 2517 place count 1002 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2518 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2519 place count 1000 transition count 961
Applied a total of 2519 rules in 294 ms. Remains 1000 /2122 variables (removed 1122) and now considering 961/2082 (removed 1121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 1000/2122 places, 961/2082 transitions.
Finished random walk after 2758 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 10 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-00 finished in 34630 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&&(!p0 U (X(p1)||G(!p0)))))))'
Support contains 3 out of 2132 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 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2131 transition count 1892
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1932 transition count 1892
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1932 transition count 1691
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1731 transition count 1691
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 810 place count 1721 transition count 1681
Iterating global reduction 2 with 10 rules applied. Total rules applied 820 place count 1721 transition count 1681
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 820 place count 1721 transition count 1674
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 834 place count 1714 transition count 1674
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 2 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2250 place count 1006 transition count 966
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 2252 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1003 transition count 964
Applied a total of 2253 rules in 377 ms. Remains 1003 /2132 variables (removed 1129) and now considering 964/2092 (removed 1128) transitions.
// Phase 1: matrix 964 rows 1003 cols
[2024-05-29 00:24:14] [INFO ] Computed 360 invariants in 9 ms
[2024-05-29 00:24:14] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-29 00:24:14] [INFO ] Invariant cache hit.
[2024-05-29 00:24:15] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2024-05-29 00:24:15] [INFO ] Redundant transitions in 200 ms returned [963]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:24:15] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:24:16] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2132 places, 963/2092 transitions.
Applied a total of 0 rules in 28 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2735 ms. Remains : 1003/2132 places, 963/2092 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s937 1) (EQ s944 1) (EQ s955 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 48 reset in 847 ms.
Product exploration explored 100000 steps with 48 reset in 1051 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 30 ms :[p0]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 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 38 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Support contains 3 out of 1003 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 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 30 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:24:18] [INFO ] Invariant cache hit.
[2024-05-29 00:24:19] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-29 00:24:19] [INFO ] Invariant cache hit.
[2024-05-29 00:24:20] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
[2024-05-29 00:24:20] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-29 00:24:20] [INFO ] Invariant cache hit.
[2024-05-29 00:24:21] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2359 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 42 ms :[p0]
Finished random walk after 113 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 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 35 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Product exploration explored 100000 steps with 48 reset in 801 ms.
Product exploration explored 100000 steps with 49 reset in 987 ms.
Built C files in :
/tmp/ltsmin2183991214851683932
[2024-05-29 00:24:23] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2024-05-29 00:24:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:23] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2024-05-29 00:24:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:23] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2024-05-29 00:24:23] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:23] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2183991214851683932
Running compilation step : cd /tmp/ltsmin2183991214851683932;'/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/ltsmin2183991214851683932;'/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/ltsmin2183991214851683932;'/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 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 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 1001 transition count 961
Applied a total of 1 rules in 54 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:24:26] [INFO ] Computed 360 invariants in 6 ms
[2024-05-29 00:24:27] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-29 00:24:27] [INFO ] Invariant cache hit.
[2024-05-29 00:24:28] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2024-05-29 00:24:28] [INFO ] Redundant transitions in 142 ms returned []
[2024-05-29 00:24:28] [INFO ] Invariant cache hit.
[2024-05-29 00:24:28] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1003 places, 961/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2305 ms. Remains : 1001/1003 places, 961/963 transitions.
Built C files in :
/tmp/ltsmin14696662652344431658
[2024-05-29 00:24:28] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-29 00:24:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:28] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-29 00:24:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:29] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-29 00:24:29] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:24:29] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14696662652344431658
Running compilation step : cd /tmp/ltsmin14696662652344431658;'/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 2822 ms.
Running link step : cd /tmp/ltsmin14696662652344431658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin14696662652344431658;'/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' '--hoa' '/tmp/stateBased2416135675150254767.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:24:44] [INFO ] Flatten gal took : 54 ms
[2024-05-29 00:24:44] [INFO ] Flatten gal took : 45 ms
[2024-05-29 00:24:44] [INFO ] Time to serialize gal into /tmp/LTL7065551225257625543.gal : 10 ms
[2024-05-29 00:24:44] [INFO ] Time to serialize properties into /tmp/LTL8303669755891873771.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/LTL7065551225257625543.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17043246066712841861.hoa' '-atoms' '/tmp/LTL8303669755891873771.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/LTL8303669755891873771.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17043246066712841861.hoa
Detected timeout of ITS tools.
[2024-05-29 00:24:59] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:24:59] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:24:59] [INFO ] Time to serialize gal into /tmp/LTL922808030321519625.gal : 7 ms
[2024-05-29 00:24:59] [INFO ] Time to serialize properties into /tmp/LTL16305392386010207452.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL922808030321519625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16305392386010207452.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 : !((F(G(((!("(((p2246==1)&&(p2257==1))&&(p2282==1))"))U((X("(p199!=1)"))||(G(!("(((p2246==1)&&(p2257==1))&&(p2282==1))")))))&&("(((p224...192
Formula 0 simplified : GF(!"(((p2246!=1)||(p2257!=1))||(p2282!=1))" | ("(((p2246==1)&&(p2257==1))&&(p2282==1))" M X!"(p199!=1)"))
Detected timeout of ITS tools.
[2024-05-29 00:25:14] [INFO ] Flatten gal took : 36 ms
[2024-05-29 00:25:14] [INFO ] Applying decomposition
[2024-05-29 00:25:14] [INFO ] Flatten gal took : 52 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/graph2665239534906160083.txt' '-o' '/tmp/graph2665239534906160083.bin' '-w' '/tmp/graph2665239534906160083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2665239534906160083.bin' '-l' '-1' '-v' '-w' '/tmp/graph2665239534906160083.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:25:14] [INFO ] Decomposing Gal with order
[2024-05-29 00:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:25:14] [INFO ] Removed a total of 642 redundant transitions.
[2024-05-29 00:25:14] [INFO ] Flatten gal took : 158 ms
[2024-05-29 00:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 23 ms.
[2024-05-29 00:25:15] [INFO ] Time to serialize gal into /tmp/LTL9997068173545386139.gal : 17 ms
[2024-05-29 00:25:15] [INFO ] Time to serialize properties into /tmp/LTL1377523792594684938.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/LTL9997068173545386139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1377523792594684938.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(((!("(((i37.i2.u338.p2246==1)&&(i37.i2.u340.p2257==1))&&(i37.i2.u344.p2282==1))"))U((X("(i2.i0.u26.p199!=1)"))||(G(!("(((i37.i2...310
Formula 0 simplified : GF(!"(((i37.i2.u338.p2246!=1)||(i37.i2.u340.p2257!=1))||(i37.i2.u344.p2282!=1))" | ("(((i37.i2.u338.p2246==1)&&(i37.i2.u340.p2257==1...211
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13171812567278257142
[2024-05-29 00:25:30] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13171812567278257142
Running compilation step : cd /tmp/ltsmin13171812567278257142;'/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 1755 ms.
Running link step : cd /tmp/ltsmin13171812567278257142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13171812567278257142;'/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) U (X((LTLAPp1==true))||[](!(LTLAPp0==true))))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-01 finished in 91515 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 U (p1||G(!p0)))))'
Support contains 4 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2123 transition count 2083
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2123 transition count 2083
Applied a total of 18 rules in 214 ms. Remains 2123 /2132 variables (removed 9) and now considering 2083/2092 (removed 9) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2024-05-29 00:25:45] [INFO ] Computed 361 invariants in 14 ms
[2024-05-29 00:25:46] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-29 00:25:46] [INFO ] Invariant cache hit.
[2024-05-29 00:25:48] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
[2024-05-29 00:25:48] [INFO ] Invariant cache hit.
[2024-05-29 00:25:49] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2132 places, 2083/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4673 ms. Remains : 2123/2132 places, 2083/2092 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s439 1) (NOT (AND (EQ s1104 1) (EQ s1112 1) (EQ s1134 1)))), p0:(AND (EQ s1104 1) (EQ s1112 1) (EQ s1134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1257 ms.
Product exploration explored 100000 steps with 50000 reset in 1251 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-02 finished in 7413 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||G(p1)))))'
Support contains 2 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1930 transition count 1690
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1730 transition count 1690
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 810 place count 1722 transition count 1682
Iterating global reduction 2 with 8 rules applied. Total rules applied 818 place count 1722 transition count 1682
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 818 place count 1722 transition count 1676
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 830 place count 1716 transition count 1676
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 2 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2252 place count 1005 transition count 965
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 2254 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1002 transition count 963
Applied a total of 2255 rules in 411 ms. Remains 1002 /2132 variables (removed 1130) and now considering 963/2092 (removed 1129) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2024-05-29 00:25:53] [INFO ] Computed 360 invariants in 8 ms
[2024-05-29 00:25:53] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-29 00:25:53] [INFO ] Invariant cache hit.
[2024-05-29 00:25:54] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
[2024-05-29 00:25:54] [INFO ] Redundant transitions in 94 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 1002 cols
[2024-05-29 00:25:54] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:25:55] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2132 places, 962/2092 transitions.
Applied a total of 0 rules in 25 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2779 ms. Remains : 1002/2132 places, 962/2092 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s18 0), p0:(EQ s300 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 48 reset in 812 ms.
Product exploration explored 100000 steps with 48 reset in 962 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/1002 stabilizing places and 2/962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 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)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:25:57] [INFO ] Invariant cache hit.
[2024-05-29 00:25:57] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:25:57] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:25:58] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:25:58] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-29 00:25:58] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 344 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 178 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 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 27 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-29 00:25:58] [INFO ] Invariant cache hit.
[2024-05-29 00:25:59] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-29 00:25:59] [INFO ] Invariant cache hit.
[2024-05-29 00:26:00] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2024-05-29 00:26:00] [INFO ] Redundant transitions in 106 ms returned []
[2024-05-29 00:26:00] [INFO ] Invariant cache hit.
[2024-05-29 00:26:01] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2258 ms. Remains : 1002/1002 places, 962/962 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/1002 stabilizing places and 2/962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 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 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:26:01] [INFO ] Invariant cache hit.
[2024-05-29 00:26:01] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:26:01] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:26:02] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:26:02] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 00:26:02] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 341 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 178 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 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 48 reset in 770 ms.
Product exploration explored 100000 steps with 49 reset in 953 ms.
Built C files in :
/tmp/ltsmin16728794095106301582
[2024-05-29 00:26:04] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-29 00:26:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:04] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-29 00:26:04] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:04] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-29 00:26:04] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:04] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16728794095106301582
Running compilation step : cd /tmp/ltsmin16728794095106301582;'/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 2783 ms.
Running link step : cd /tmp/ltsmin16728794095106301582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16728794095106301582;'/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' '--hoa' '/tmp/stateBased10357913065714686727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 22 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-29 00:26:19] [INFO ] Invariant cache hit.
[2024-05-29 00:26:19] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-29 00:26:19] [INFO ] Invariant cache hit.
[2024-05-29 00:26:21] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2024-05-29 00:26:21] [INFO ] Redundant transitions in 96 ms returned []
[2024-05-29 00:26:21] [INFO ] Invariant cache hit.
[2024-05-29 00:26:21] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2208 ms. Remains : 1002/1002 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin7020533994252739883
[2024-05-29 00:26:21] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-29 00:26:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:21] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-29 00:26:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:21] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-29 00:26:21] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:26:21] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7020533994252739883
Running compilation step : cd /tmp/ltsmin7020533994252739883;'/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 2727 ms.
Running link step : cd /tmp/ltsmin7020533994252739883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7020533994252739883;'/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' '--hoa' '/tmp/stateBased808099567904687936.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:26:36] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:26:36] [INFO ] Flatten gal took : 32 ms
[2024-05-29 00:26:36] [INFO ] Time to serialize gal into /tmp/LTL18065020823186412666.gal : 6 ms
[2024-05-29 00:26:36] [INFO ] Time to serialize properties into /tmp/LTL12574874384062462724.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/LTL18065020823186412666.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14289094233549394186.hoa' '-atoms' '/tmp/LTL12574874384062462724.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/LTL12574874384062462724.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14289094233549394186.hoa
Detected timeout of ITS tools.
[2024-05-29 00:26:51] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:26:51] [INFO ] Flatten gal took : 31 ms
[2024-05-29 00:26:52] [INFO ] Time to serialize gal into /tmp/LTL11865678613094264456.gal : 6 ms
[2024-05-29 00:26:52] [INFO ] Time to serialize properties into /tmp/LTL3788976510667813479.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/LTL11865678613094264456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3788976510667813479.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(F(("(p741==0)")||(G("(p77==0)"))))))
Formula 0 simplified : G(F!"(p77==0)" & FG!"(p741==0)")
Detected timeout of ITS tools.
[2024-05-29 00:27:07] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:27:07] [INFO ] Applying decomposition
[2024-05-29 00:27:07] [INFO ] Flatten gal took : 29 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/graph13552765267105868031.txt' '-o' '/tmp/graph13552765267105868031.bin' '-w' '/tmp/graph13552765267105868031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13552765267105868031.bin' '-l' '-1' '-v' '-w' '/tmp/graph13552765267105868031.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:27:07] [INFO ] Decomposing Gal with order
[2024-05-29 00:27:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:27:07] [INFO ] Removed a total of 638 redundant transitions.
[2024-05-29 00:27:07] [INFO ] Flatten gal took : 54 ms
[2024-05-29 00:27:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 11 ms.
[2024-05-29 00:27:07] [INFO ] Time to serialize gal into /tmp/LTL8591382410095703979.gal : 16 ms
[2024-05-29 00:27:07] [INFO ] Time to serialize properties into /tmp/LTL414731191090939032.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/LTL8591382410095703979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL414731191090939032.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 : !((G(F(("(i11.i2.u108.p741==0)")||(G("(i0.u7.p77==0)"))))))
Formula 0 simplified : G(F!"(i0.u7.p77==0)" & FG!"(i11.i2.u108.p741==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6487662870352992885
[2024-05-29 00:27:22] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6487662870352992885
Running compilation step : cd /tmp/ltsmin6487662870352992885;'/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 1680 ms.
Running link step : cd /tmp/ltsmin6487662870352992885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6487662870352992885;'/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-040B-LTLFireability-03 finished in 104972 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)))'
Support contains 2 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2131 transition count 1891
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1931 transition count 1890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 402 place count 1930 transition count 1689
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 804 place count 1729 transition count 1689
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 814 place count 1719 transition count 1679
Iterating global reduction 3 with 10 rules applied. Total rules applied 824 place count 1719 transition count 1679
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 824 place count 1719 transition count 1672
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 838 place count 1712 transition count 1672
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 2258 place count 1002 transition count 962
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2260 place count 1000 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2261 place count 999 transition count 960
Applied a total of 2261 rules in 363 ms. Remains 999 /2132 variables (removed 1133) and now considering 960/2092 (removed 1132) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-29 00:27:37] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:27:38] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-29 00:27:38] [INFO ] Invariant cache hit.
[2024-05-29 00:27:39] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2024-05-29 00:27:39] [INFO ] Redundant transitions in 104 ms returned [959]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-29 00:27:39] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:27:40] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2132 places, 959/2092 transitions.
Applied a total of 0 rules in 23 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2721 ms. Remains : 999/2132 places, 959/2092 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s306 0) (EQ s308 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 74 reset in 818 ms.
Product exploration explored 100000 steps with 73 reset in 995 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1404 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 27 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 00:27:42] [INFO ] Invariant cache hit.
[2024-05-29 00:27:43] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-29 00:27:43] [INFO ] Invariant cache hit.
[2024-05-29 00:27:44] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-29 00:27:44] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-29 00:27:44] [INFO ] Invariant cache hit.
[2024-05-29 00:27:44] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2249 ms. Remains : 999/999 places, 959/959 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1300 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 74 reset in 811 ms.
Product exploration explored 100000 steps with 74 reset in 971 ms.
Built C files in :
/tmp/ltsmin4259705228126060194
[2024-05-29 00:27:47] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-29 00:27:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:27:47] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-29 00:27:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:27:47] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-29 00:27:47] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:27:47] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4259705228126060194
Running compilation step : cd /tmp/ltsmin4259705228126060194;'/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 2933 ms.
Running link step : cd /tmp/ltsmin4259705228126060194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4259705228126060194;'/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' '--hoa' '/tmp/stateBased12274149891860117634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 23 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-29 00:28:02] [INFO ] Invariant cache hit.
[2024-05-29 00:28:02] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-29 00:28:02] [INFO ] Invariant cache hit.
[2024-05-29 00:28:04] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2024-05-29 00:28:04] [INFO ] Redundant transitions in 110 ms returned []
[2024-05-29 00:28:04] [INFO ] Invariant cache hit.
[2024-05-29 00:28:04] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2280 ms. Remains : 999/999 places, 959/959 transitions.
Built C files in :
/tmp/ltsmin4190504725275272561
[2024-05-29 00:28:04] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-29 00:28:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:28:04] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-29 00:28:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:28:04] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-29 00:28:04] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:28:04] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4190504725275272561
Running compilation step : cd /tmp/ltsmin4190504725275272561;'/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 2655 ms.
Running link step : cd /tmp/ltsmin4190504725275272561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4190504725275272561;'/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' '--hoa' '/tmp/stateBased11130901692292637145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:28:19] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:28:19] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:28:19] [INFO ] Time to serialize gal into /tmp/LTL3461483903737360092.gal : 6 ms
[2024-05-29 00:28:19] [INFO ] Time to serialize properties into /tmp/LTL15226220647297781807.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/LTL3461483903737360092.gal' '-t' 'CGAL' '-hoa' '/tmp/aut428234524150140276.hoa' '-atoms' '/tmp/LTL15226220647297781807.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/LTL15226220647297781807.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut428234524150140276.hoa
Detected timeout of ITS tools.
[2024-05-29 00:28:34] [INFO ] Flatten gal took : 30 ms
[2024-05-29 00:28:35] [INFO ] Flatten gal took : 30 ms
[2024-05-29 00:28:35] [INFO ] Time to serialize gal into /tmp/LTL15843066059985223832.gal : 6 ms
[2024-05-29 00:28:35] [INFO ] Time to serialize properties into /tmp/LTL11015764663526219356.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/LTL15843066059985223832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11015764663526219356.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("((p766==0)||(p768==0))"))))
Formula 0 simplified : FG!"((p766==0)||(p768==0))"
Detected timeout of ITS tools.
[2024-05-29 00:28:50] [INFO ] Flatten gal took : 32 ms
[2024-05-29 00:28:50] [INFO ] Applying decomposition
[2024-05-29 00:28:50] [INFO ] Flatten gal took : 32 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/graph10431033880797593239.txt' '-o' '/tmp/graph10431033880797593239.bin' '-w' '/tmp/graph10431033880797593239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10431033880797593239.bin' '-l' '-1' '-v' '-w' '/tmp/graph10431033880797593239.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:28:50] [INFO ] Decomposing Gal with order
[2024-05-29 00:28:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:28:50] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:28:50] [INFO ] Flatten gal took : 50 ms
[2024-05-29 00:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 11 ms.
[2024-05-29 00:28:50] [INFO ] Time to serialize gal into /tmp/LTL12936394988387432672.gal : 11 ms
[2024-05-29 00:28:50] [INFO ] Time to serialize properties into /tmp/LTL3019073748353828563.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/LTL12936394988387432672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3019073748353828563.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(F("((i12.i1.u110.p766==0)||(i12.i0.u111.p768==0))"))))
Formula 0 simplified : FG!"((i12.i1.u110.p766==0)||(i12.i0.u111.p768==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1433322874695377257
[2024-05-29 00:29:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1433322874695377257
Running compilation step : cd /tmp/ltsmin1433322874695377257;'/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 1810 ms.
Running link step : cd /tmp/ltsmin1433322874695377257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1433322874695377257;'/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-040B-LTLFireability-04 finished in 102914 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 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1930 transition count 1690
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1730 transition count 1690
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 812 place count 1720 transition count 1680
Iterating global reduction 2 with 10 rules applied. Total rules applied 822 place count 1720 transition count 1680
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 822 place count 1720 transition count 1673
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 836 place count 1713 transition count 1673
Performed 709 Post agglomeration using F-continuation condition.Transition count delta: 709
Deduced a syphon composed of 709 places in 2 ms
Reduce places removed 709 places and 0 transitions.
Iterating global reduction 2 with 1418 rules applied. Total rules applied 2254 place count 1004 transition count 964
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 2256 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1001 transition count 962
Applied a total of 2257 rules in 307 ms. Remains 1001 /2132 variables (removed 1131) and now considering 962/2092 (removed 1130) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-29 00:29:20] [INFO ] Computed 360 invariants in 5 ms
[2024-05-29 00:29:21] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-29 00:29:21] [INFO ] Invariant cache hit.
[2024-05-29 00:29:22] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2024-05-29 00:29:22] [INFO ] Redundant transitions in 127 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:29:22] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:29:23] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2132 places, 961/2092 transitions.
Applied a total of 0 rules in 22 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2643 ms. Remains : 1001/2132 places, 961/2092 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-05 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 s500 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 49 reset in 818 ms.
Product exploration explored 100000 steps with 48 reset in 982 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 38 ms :[(NOT p0)]
Finished random walk after 925 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:29:25] [INFO ] Invariant cache hit.
[2024-05-29 00:29:25] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 00:29:25] [INFO ] Invariant cache hit.
[2024-05-29 00:29:26] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2024-05-29 00:29:27] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-29 00:29:27] [INFO ] Invariant cache hit.
[2024-05-29 00:29:27] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2322 ms. Remains : 1001/1001 places, 961/961 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 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 44 ms :[(NOT p0)]
Finished random walk after 887 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 49 reset in 807 ms.
Product exploration explored 100000 steps with 48 reset in 1008 ms.
Built C files in :
/tmp/ltsmin10754312320022034702
[2024-05-29 00:29:29] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-29 00:29:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:29:29] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-29 00:29:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:29:30] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-29 00:29:30] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:29:30] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10754312320022034702
Running compilation step : cd /tmp/ltsmin10754312320022034702;'/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 2823 ms.
Running link step : cd /tmp/ltsmin10754312320022034702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10754312320022034702;'/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' '--hoa' '/tmp/stateBased6082798101404747705.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 24 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:29:44] [INFO ] Invariant cache hit.
[2024-05-29 00:29:45] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-29 00:29:45] [INFO ] Invariant cache hit.
[2024-05-29 00:29:46] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2024-05-29 00:29:46] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-29 00:29:46] [INFO ] Invariant cache hit.
[2024-05-29 00:29:47] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2257 ms. Remains : 1001/1001 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin13065212315264938897
[2024-05-29 00:29:47] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-29 00:29:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:29:47] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-29 00:29:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:29:47] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-29 00:29:47] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:29:47] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13065212315264938897
Running compilation step : cd /tmp/ltsmin13065212315264938897;'/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 2796 ms.
Running link step : cd /tmp/ltsmin13065212315264938897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13065212315264938897;'/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' '--hoa' '/tmp/stateBased11534365447383372346.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:30:02] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:30:02] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:30:02] [INFO ] Time to serialize gal into /tmp/LTL7084563883602076077.gal : 5 ms
[2024-05-29 00:30:02] [INFO ] Time to serialize properties into /tmp/LTL18021305260888454685.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/LTL7084563883602076077.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6735448525264210826.hoa' '-atoms' '/tmp/LTL18021305260888454685.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/LTL18021305260888454685.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6735448525264210826.hoa
Detected timeout of ITS tools.
[2024-05-29 00:30:17] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:30:17] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:30:17] [INFO ] Time to serialize gal into /tmp/LTL4543088647029097969.gal : 6 ms
[2024-05-29 00:30:17] [INFO ] Time to serialize properties into /tmp/LTL2230631342922808852.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/LTL4543088647029097969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2230631342922808852.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 : !((F(G("(p1215==0)"))))
Formula 0 simplified : GF!"(p1215==0)"
Detected timeout of ITS tools.
[2024-05-29 00:30:32] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:30:32] [INFO ] Applying decomposition
[2024-05-29 00:30:32] [INFO ] Flatten gal took : 27 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/graph12355652373822152997.txt' '-o' '/tmp/graph12355652373822152997.bin' '-w' '/tmp/graph12355652373822152997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12355652373822152997.bin' '-l' '-1' '-v' '-w' '/tmp/graph12355652373822152997.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:30:32] [INFO ] Decomposing Gal with order
[2024-05-29 00:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:30:32] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-29 00:30:32] [INFO ] Flatten gal took : 46 ms
[2024-05-29 00:30:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 11 ms.
[2024-05-29 00:30:32] [INFO ] Time to serialize gal into /tmp/LTL2330202911343670321.gal : 7 ms
[2024-05-29 00:30:32] [INFO ] Time to serialize properties into /tmp/LTL825492484963197135.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/LTL2330202911343670321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL825492484963197135.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 : !((F(G("(i19.i0.u180.p1215==0)"))))
Formula 0 simplified : GF!"(i19.i0.u180.p1215==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9302919556096189914
[2024-05-29 00:30:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9302919556096189914
Running compilation step : cd /tmp/ltsmin9302919556096189914;'/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 1720 ms.
Running link step : cd /tmp/ltsmin9302919556096189914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9302919556096189914;'/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-040B-LTLFireability-05 finished in 102425 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(X(X(F(p0)))))'
Support contains 1 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 207 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:31:03] [INFO ] Computed 361 invariants in 11 ms
[2024-05-29 00:31:03] [INFO ] Implicit Places using invariants in 823 ms returned []
[2024-05-29 00:31:03] [INFO ] Invariant cache hit.
[2024-05-29 00:31:06] [INFO ] Implicit Places using invariants and state equation in 2353 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
[2024-05-29 00:31:06] [INFO ] Invariant cache hit.
[2024-05-29 00:31:07] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4757 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s518 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 97 reset in 655 ms.
Product exploration explored 100000 steps with 98 reset in 736 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 769 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 00:31:10] [INFO ] Invariant cache hit.
[2024-05-29 00:31:11] [INFO ] [Real]Absence check using 361 positive place invariants in 536 ms returned sat
[2024-05-29 00:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:31:24] [INFO ] [Real]Absence check using state equation in 13204 ms returned sat
[2024-05-29 00:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:31:26] [INFO ] [Nat]Absence check using 361 positive place invariants in 541 ms returned sat
[2024-05-29 00:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:31:40] [INFO ] [Nat]Absence check using state equation in 13303 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 95 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2024-05-29 00:31:40] [INFO ] Invariant cache hit.
[2024-05-29 00:31:40] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-29 00:31:40] [INFO ] Invariant cache hit.
[2024-05-29 00:31:43] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned []
Implicit Place search using SMT with State Equation took 3156 ms to find 0 implicit places.
[2024-05-29 00:31:43] [INFO ] Invariant cache hit.
[2024-05-29 00:31:44] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4653 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1209 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 00:31:45] [INFO ] Invariant cache hit.
[2024-05-29 00:31:47] [INFO ] [Real]Absence check using 361 positive place invariants in 548 ms returned sat
[2024-05-29 00:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:32:00] [INFO ] [Real]Absence check using state equation in 13287 ms returned sat
[2024-05-29 00:32:01] [INFO ] Deduced a trap composed of 21 places in 1208 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.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 00:32:01] [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 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 95 reset in 597 ms.
Product exploration explored 100000 steps with 95 reset in 686 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 2082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 200 place count 2122 transition count 2084
Deduced a syphon composed of 281 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 281 place count 2122 transition count 2084
Performed 838 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 1 with 838 rules applied. Total rules applied 1119 place count 2122 transition count 2084
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1400 place count 1841 transition count 1803
Deduced a syphon composed of 838 places in 2 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1681 place count 1841 transition count 1803
Deduced a syphon composed of 838 places in 2 ms
Applied a total of 1681 rules in 784 ms. Remains 1841 /2122 variables (removed 281) and now considering 1803/2082 (removed 279) transitions.
[2024-05-29 00:32:04] [INFO ] Redundant transitions in 158 ms returned [1802]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1802 rows 1841 cols
[2024-05-29 00:32:04] [INFO ] Computed 361 invariants in 17 ms
[2024-05-29 00:32:05] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1841/2122 places, 1802/2082 transitions.
Deduced a syphon composed of 838 places in 2 ms
Applied a total of 0 rules in 64 ms. Remains 1841 /1841 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2144 ms. Remains : 1841/2122 places, 1802/2082 transitions.
Built C files in :
/tmp/ltsmin14683932052557640815
[2024-05-29 00:32:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14683932052557640815
Running compilation step : cd /tmp/ltsmin14683932052557640815;'/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/ltsmin14683932052557640815;'/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/ltsmin14683932052557640815;'/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 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 77 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:32:08] [INFO ] Computed 361 invariants in 11 ms
[2024-05-29 00:32:09] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-29 00:32:09] [INFO ] Invariant cache hit.
[2024-05-29 00:32:11] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
[2024-05-29 00:32:11] [INFO ] Invariant cache hit.
[2024-05-29 00:32:12] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4319 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin10541937926182485454
[2024-05-29 00:32:13] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10541937926182485454
Running compilation step : cd /tmp/ltsmin10541937926182485454;'/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/ltsmin10541937926182485454;'/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/ltsmin10541937926182485454;'/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 00:32:16] [INFO ] Flatten gal took : 46 ms
[2024-05-29 00:32:16] [INFO ] Flatten gal took : 47 ms
[2024-05-29 00:32:16] [INFO ] Time to serialize gal into /tmp/LTL15709967185505836999.gal : 9 ms
[2024-05-29 00:32:16] [INFO ] Time to serialize properties into /tmp/LTL11306718740484037726.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/LTL15709967185505836999.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5870815887214028361.hoa' '-atoms' '/tmp/LTL11306718740484037726.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/LTL11306718740484037726.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5870815887214028361.hoa
Detected timeout of ITS tools.
[2024-05-29 00:32:31] [INFO ] Flatten gal took : 56 ms
[2024-05-29 00:32:31] [INFO ] Flatten gal took : 51 ms
[2024-05-29 00:32:31] [INFO ] Time to serialize gal into /tmp/LTL18258253301394581157.gal : 9 ms
[2024-05-29 00:32:31] [INFO ] Time to serialize properties into /tmp/LTL13538441935026816040.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/LTL18258253301394581157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13538441935026816040.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(X(X(F("(p581==1)"))))))
Formula 0 simplified : XXXG!"(p581==1)"
Detected timeout of ITS tools.
[2024-05-29 00:32:46] [INFO ] Flatten gal took : 47 ms
[2024-05-29 00:32:46] [INFO ] Applying decomposition
[2024-05-29 00:32:46] [INFO ] Flatten gal took : 62 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/graph5425209129665477071.txt' '-o' '/tmp/graph5425209129665477071.bin' '-w' '/tmp/graph5425209129665477071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5425209129665477071.bin' '-l' '-1' '-v' '-w' '/tmp/graph5425209129665477071.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:32:46] [INFO ] Decomposing Gal with order
[2024-05-29 00:32:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:32:46] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-29 00:32:46] [INFO ] Flatten gal took : 86 ms
[2024-05-29 00:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 00:32:46] [INFO ] Time to serialize gal into /tmp/LTL13576218275521705768.gal : 19 ms
[2024-05-29 00:32:46] [INFO ] Time to serialize properties into /tmp/LTL12742760012931139121.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/LTL13576218275521705768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12742760012931139121.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 : !((X(X(X(F("(i9.i1.u197.p581==1)"))))))
Formula 0 simplified : XXXG!"(i9.i1.u197.p581==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18081799520980921546
[2024-05-29 00:33:02] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18081799520980921546
Running compilation step : cd /tmp/ltsmin18081799520980921546;'/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/ltsmin18081799520980921546;'/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/ltsmin18081799520980921546;'/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)
Treatment of property ShieldIIPs-PT-040B-LTLFireability-06 finished in 122123 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(p1)||p0))))'
Support contains 6 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2131 transition count 1892
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1932 transition count 1892
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1932 transition count 1691
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1731 transition count 1691
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 810 place count 1721 transition count 1681
Iterating global reduction 2 with 10 rules applied. Total rules applied 820 place count 1721 transition count 1681
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 820 place count 1721 transition count 1675
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 832 place count 1715 transition count 1675
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2252 place count 1005 transition count 965
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 2254 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1002 transition count 963
Applied a total of 2255 rules in 277 ms. Remains 1002 /2132 variables (removed 1130) and now considering 963/2092 (removed 1129) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2024-05-29 00:33:05] [INFO ] Computed 360 invariants in 6 ms
[2024-05-29 00:33:05] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-05-29 00:33:05] [INFO ] Invariant cache hit.
[2024-05-29 00:33:06] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2024-05-29 00:33:07] [INFO ] Redundant transitions in 107 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 1002 cols
[2024-05-29 00:33:07] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:33:07] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2132 places, 962/2092 transitions.
Applied a total of 0 rules in 21 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2514 ms. Remains : 1002/2132 places, 962/2092 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s287 0) (EQ s292 0) (EQ s304 0)), p0:(OR (EQ s87 0) (EQ s98 0) (EQ s103 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 48 reset in 777 ms.
Product exploration explored 100000 steps with 49 reset in 975 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 (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:33:09] [INFO ] Invariant cache hit.
[2024-05-29 00:33:09] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:33:10] [INFO ] [Nat]Absence check using 360 positive place invariants in 62 ms returned sat
[2024-05-29 00:33:10] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:33:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-05-29 00:33:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 00:33:10] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-29 00:33:10] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:33:10] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:33:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 420 ms
[2024-05-29 00:33:10] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 00:33:10] [INFO ] After 1081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1002 transition count 962
Applied a total of 237 rules in 39 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Finished probabilistic random walk after 48219 steps, run visited all 1 properties in 468 ms. (steps per millisecond=103 )
Probabilistic random walk after 48219 steps, saw 47331 distinct states, run finished after 468 ms. (steps per millisecond=103 ) properties seen :1
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
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 p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 21 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-29 00:33:11] [INFO ] Invariant cache hit.
[2024-05-29 00:33:12] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 00:33:12] [INFO ] Invariant cache hit.
[2024-05-29 00:33:13] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2024-05-29 00:33:13] [INFO ] Redundant transitions in 95 ms returned []
[2024-05-29 00:33:13] [INFO ] Invariant cache hit.
[2024-05-29 00:33:14] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2145 ms. Remains : 1002/1002 places, 962/962 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5886 steps, including 2 resets, run visited all 2 properties in 73 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 121 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49 reset in 773 ms.
Product exploration explored 100000 steps with 48 reset in 947 ms.
Built C files in :
/tmp/ltsmin10197617760290146435
[2024-05-29 00:33:16] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-29 00:33:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:16] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-29 00:33:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:16] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-29 00:33:16] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:16] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10197617760290146435
Running compilation step : cd /tmp/ltsmin10197617760290146435;'/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 2731 ms.
Running link step : cd /tmp/ltsmin10197617760290146435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10197617760290146435;'/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' '--hoa' '/tmp/stateBased14381005575518127703.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 18 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-29 00:33:31] [INFO ] Invariant cache hit.
[2024-05-29 00:33:31] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-29 00:33:31] [INFO ] Invariant cache hit.
[2024-05-29 00:33:32] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-29 00:33:33] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-29 00:33:33] [INFO ] Invariant cache hit.
[2024-05-29 00:33:33] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2131 ms. Remains : 1002/1002 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin15864547692829133980
[2024-05-29 00:33:33] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-29 00:33:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:33] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-29 00:33:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:33] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-29 00:33:33] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:33] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15864547692829133980
Running compilation step : cd /tmp/ltsmin15864547692829133980;'/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 2711 ms.
Running link step : cd /tmp/ltsmin15864547692829133980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15864547692829133980;'/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' '--hoa' '/tmp/stateBased6533444935109347762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:33:48] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:33:48] [INFO ] Flatten gal took : 31 ms
[2024-05-29 00:33:48] [INFO ] Time to serialize gal into /tmp/LTL8963647161699685825.gal : 5 ms
[2024-05-29 00:33:48] [INFO ] Time to serialize properties into /tmp/LTL10369566659593382140.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/LTL8963647161699685825.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3890214636735702536.hoa' '-atoms' '/tmp/LTL10369566659593382140.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/LTL10369566659593382140.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3890214636735702536.hoa
Detected timeout of ITS tools.
[2024-05-29 00:34:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:34:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:34:03] [INFO ] Time to serialize gal into /tmp/LTL2951702853533674979.gal : 7 ms
[2024-05-29 00:34:03] [INFO ] Time to serialize properties into /tmp/LTL14569010522938467425.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/LTL2951702853533674979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14569010522938467425.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(F(("((p243==0)||(p265==0))")||(("(p276==0)")||(G("(((p712==0)||(p720==0))||(p748==0))")))))))
Formula 0 simplified : G(F!"(((p712==0)||(p720==0))||(p748==0))" & FG(!"((p243==0)||(p265==0))" & !"(p276==0)"))
Detected timeout of ITS tools.
[2024-05-29 00:34:18] [INFO ] Flatten gal took : 33 ms
[2024-05-29 00:34:18] [INFO ] Applying decomposition
[2024-05-29 00:34:18] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15961178488774378289.txt' '-o' '/tmp/graph15961178488774378289.bin' '-w' '/tmp/graph15961178488774378289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15961178488774378289.bin' '-l' '-1' '-v' '-w' '/tmp/graph15961178488774378289.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:34:19] [INFO ] Decomposing Gal with order
[2024-05-29 00:34:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:34:19] [INFO ] Removed a total of 643 redundant transitions.
[2024-05-29 00:34:19] [INFO ] Flatten gal took : 43 ms
[2024-05-29 00:34:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 8 ms.
[2024-05-29 00:34:19] [INFO ] Time to serialize gal into /tmp/LTL6608178203939027932.gal : 7 ms
[2024-05-29 00:34:19] [INFO ] Time to serialize properties into /tmp/LTL3624125991756926691.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/LTL6608178203939027932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3624125991756926691.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 : !((G(F(("((i3.i0.u32.p243==0)||(i3.i0.u36.p265==0))")||(("(i3.i2.u37.p276==0)")||(G("(((i11.i1.u105.p712==0)||(i11.i1.u107.p720==0))||...185
Formula 0 simplified : G(F!"(((i11.i1.u105.p712==0)||(i11.i1.u107.p720==0))||(i11.i2.u110.p748==0))" & FG(!"((i3.i0.u32.p243==0)||(i3.i0.u36.p265==0))" & !...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10180336384010057042
[2024-05-29 00:34:34] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10180336384010057042
Running compilation step : cd /tmp/ltsmin10180336384010057042;'/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 1755 ms.
Running link step : cd /tmp/ltsmin10180336384010057042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10180336384010057042;'/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' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-07 finished in 104244 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)))'
Support contains 1 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 141 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:34:49] [INFO ] Computed 361 invariants in 14 ms
[2024-05-29 00:34:50] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-29 00:34:50] [INFO ] Invariant cache hit.
[2024-05-29 00:34:52] [INFO ] Implicit Places using invariants and state equation in 2345 ms returned []
Implicit Place search using SMT with State Equation took 3123 ms to find 0 implicit places.
[2024-05-29 00:34:52] [INFO ] Invariant cache hit.
[2024-05-29 00:34:53] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4581 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s403 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1229 ms.
Product exploration explored 100000 steps with 50000 reset in 1221 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-08 finished in 7180 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(((F(p0) U G(p1))&&(p0||F(G(p2))))))'
Support contains 4 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1930 transition count 1689
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1729 transition count 1689
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 813 place count 1720 transition count 1680
Iterating global reduction 2 with 9 rules applied. Total rules applied 822 place count 1720 transition count 1680
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 822 place count 1720 transition count 1674
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 834 place count 1714 transition count 1674
Performed 707 Post agglomeration using F-continuation condition.Transition count delta: 707
Deduced a syphon composed of 707 places in 2 ms
Reduce places removed 707 places and 0 transitions.
Iterating global reduction 2 with 1414 rules applied. Total rules applied 2248 place count 1007 transition count 967
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 2250 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1004 transition count 965
Applied a total of 2251 rules in 275 ms. Remains 1004 /2132 variables (removed 1128) and now considering 965/2092 (removed 1127) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:34:56] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:34:57] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-29 00:34:57] [INFO ] Invariant cache hit.
[2024-05-29 00:34:58] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
[2024-05-29 00:34:58] [INFO ] Redundant transitions in 98 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 964 rows 1004 cols
[2024-05-29 00:34:58] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:34:59] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2132 places, 964/2092 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2538 ms. Remains : 1004/2132 places, 964/2092 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s864 1) (EQ s899 1)), p1:(EQ s714 1), p2:(EQ s235 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1430 reset in 720 ms.
Product exploration explored 100000 steps with 1440 reset in 883 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 174 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 15) seen :12
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 70 ms. (steps per millisecond=142 ) 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
Running SMT prover for 3 properties.
[2024-05-29 00:35:02] [INFO ] Invariant cache hit.
[2024-05-29 00:35:02] [INFO ] [Real]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:35:02] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:35:02] [INFO ] [Nat]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:35:03] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:35:03] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-29 00:35:03] [INFO ] After 1030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 123 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1004 transition count 964
Applied a total of 237 rules in 55 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1004/1004 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 964 rows 1004 cols
[2024-05-29 00:35:04] [INFO ] Computed 360 invariants in 20 ms
[2024-05-29 00:35:04] [INFO ] [Real]Absence check using 360 positive place invariants in 61 ms returned sat
[2024-05-29 00:35:04] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:35:04] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:35:05] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 00:35:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2024-05-29 00:35:05] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-29 00:35:05] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1004/1004 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 269648 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269648 steps, saw 262570 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:35:08] [INFO ] Invariant cache hit.
[2024-05-29 00:35:09] [INFO ] [Real]Absence check using 360 positive place invariants in 61 ms returned sat
[2024-05-29 00:35:09] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:35:09] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:35:10] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:35:10] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 00:35:10] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 21 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1004/1004 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 21 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-29 00:35:10] [INFO ] Invariant cache hit.
[2024-05-29 00:35:10] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-29 00:35:10] [INFO ] Invariant cache hit.
[2024-05-29 00:35:12] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2024-05-29 00:35:12] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 00:35:12] [INFO ] Invariant cache hit.
[2024-05-29 00:35:12] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2529 ms. Remains : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 20 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:35:12] [INFO ] Invariant cache hit.
[2024-05-29 00:35:13] [INFO ] [Real]Absence check using 360 positive place invariants in 61 ms returned sat
[2024-05-29 00:35:13] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:35:13] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:35:14] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:35:14] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 00:35:14] [INFO ] After 737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p2 p1)), (F p0)]
Knowledge based reduction with 16 factoid took 811 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
// Phase 1: matrix 964 rows 1004 cols
[2024-05-29 00:35:15] [INFO ] Computed 360 invariants in 5 ms
[2024-05-29 00:35:16] [INFO ] [Real]Absence check using 360 positive place invariants in 187 ms returned sat
[2024-05-29 00:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:18] [INFO ] [Real]Absence check using state equation in 2150 ms returned sat
[2024-05-29 00:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:35:19] [INFO ] [Nat]Absence check using 360 positive place invariants in 160 ms returned sat
[2024-05-29 00:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:22] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2024-05-29 00:35:22] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 54 ms.
[2024-05-29 00:35:34] [INFO ] Deduced a trap composed of 2 places in 517 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.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 00:35:34] [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 00:35:34] [INFO ] Invariant cache hit.
[2024-05-29 00:35:35] [INFO ] [Real]Absence check using 360 positive place invariants in 193 ms returned sat
[2024-05-29 00:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:37] [INFO ] [Real]Absence check using state equation in 2201 ms returned sat
[2024-05-29 00:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:35:38] [INFO ] [Nat]Absence check using 360 positive place invariants in 205 ms returned sat
[2024-05-29 00:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:40] [INFO ] [Nat]Absence check using state equation in 2140 ms returned sat
[2024-05-29 00:35:40] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 00:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-29 00:35:40] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 72 ms.
[2024-05-29 00:35:49] [INFO ] Added : 515 causal constraints over 103 iterations in 9088 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 21 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-29 00:35:49] [INFO ] Invariant cache hit.
[2024-05-29 00:35:50] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-29 00:35:50] [INFO ] Invariant cache hit.
[2024-05-29 00:35:51] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2024-05-29 00:35:51] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-29 00:35:51] [INFO ] Invariant cache hit.
[2024-05-29 00:35:51] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2236 ms. Remains : 1004/1004 places, 964/964 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 306 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 00:35:53] [INFO ] Invariant cache hit.
[2024-05-29 00:35:53] [INFO ] [Real]Absence check using 360 positive place invariants in 54 ms returned sat
[2024-05-29 00:35:53] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:35:53] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:35:54] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:35:54] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-29 00:35:54] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 568 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=43 )
Parikh walk visited 4 properties in 92 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2 p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p2 p1)), (F p0)]
Knowledge based reduction with 28 factoid took 1493 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
[2024-05-29 00:35:57] [INFO ] Invariant cache hit.
[2024-05-29 00:35:58] [INFO ] [Real]Absence check using 360 positive place invariants in 194 ms returned sat
[2024-05-29 00:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:36:00] [INFO ] [Real]Absence check using state equation in 2112 ms returned sat
[2024-05-29 00:36:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:36:01] [INFO ] [Nat]Absence check using 360 positive place invariants in 193 ms returned sat
[2024-05-29 00:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:36:02] [INFO ] [Nat]Absence check using state equation in 1912 ms returned sat
[2024-05-29 00:36:03] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 55 ms.
[2024-05-29 00:36:15] [INFO ] Added : 600 causal constraints over 120 iterations in 12270 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-29 00:36:15] [INFO ] Invariant cache hit.
[2024-05-29 00:36:16] [INFO ] [Real]Absence check using 360 positive place invariants in 190 ms returned sat
[2024-05-29 00:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:36:18] [INFO ] [Real]Absence check using state equation in 2132 ms returned sat
[2024-05-29 00:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:36:19] [INFO ] [Nat]Absence check using 360 positive place invariants in 194 ms returned sat
[2024-05-29 00:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:36:21] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2024-05-29 00:36:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 00:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-29 00:36:21] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 59 ms.
[2024-05-29 00:36:29] [INFO ] Added : 515 causal constraints over 103 iterations in 8605 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1405 reset in 726 ms.
Product exploration explored 100000 steps with 1488 reset in 873 ms.
Built C files in :
/tmp/ltsmin15971405201824821904
[2024-05-29 00:36:31] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-29 00:36:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:31] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-29 00:36:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:31] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-29 00:36:31] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:31] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15971405201824821904
Running compilation step : cd /tmp/ltsmin15971405201824821904;'/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 2774 ms.
Running link step : cd /tmp/ltsmin15971405201824821904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15971405201824821904;'/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' '--hoa' '/tmp/stateBased78592986304128585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 19 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-29 00:36:46] [INFO ] Invariant cache hit.
[2024-05-29 00:36:47] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-29 00:36:47] [INFO ] Invariant cache hit.
[2024-05-29 00:36:48] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2024-05-29 00:36:48] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-29 00:36:48] [INFO ] Invariant cache hit.
[2024-05-29 00:36:49] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2276 ms. Remains : 1004/1004 places, 964/964 transitions.
Built C files in :
/tmp/ltsmin18086436203526808291
[2024-05-29 00:36:49] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-29 00:36:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:49] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-29 00:36:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:49] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-29 00:36:49] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:49] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18086436203526808291
Running compilation step : cd /tmp/ltsmin18086436203526808291;'/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 2755 ms.
Running link step : cd /tmp/ltsmin18086436203526808291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin18086436203526808291;'/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' '--hoa' '/tmp/stateBased7965056394503139484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:37:04] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:37:04] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:37:04] [INFO ] Time to serialize gal into /tmp/LTL2835176378432072194.gal : 5 ms
[2024-05-29 00:37:04] [INFO ] Time to serialize properties into /tmp/LTL9687574302101092813.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/LTL2835176378432072194.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13730825880779516965.hoa' '-atoms' '/tmp/LTL9687574302101092813.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/LTL9687574302101092813.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13730825880779516965.hoa
Detected timeout of ITS tools.
[2024-05-29 00:37:19] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:37:19] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:37:19] [INFO ] Time to serialize gal into /tmp/LTL5533262325065500686.gal : 5 ms
[2024-05-29 00:37:19] [INFO ] Time to serialize properties into /tmp/LTL6043830054611938004.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/LTL5533262325065500686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6043830054611938004.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 : !((F(((F("((p2070==1)&&(p2148==1))"))U(G("(p1720==1)")))&&((F(G("(p593==1)")))||("((p2070==1)&&(p2148==1))")))))
Formula 0 simplified : G((G!"((p2070==1)&&(p2148==1))" R F!"(p1720==1)") | (!"((p2070==1)&&(p2148==1))" & GF!"(p593==1)"))
Detected timeout of ITS tools.
[2024-05-29 00:37:34] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:37:34] [INFO ] Applying decomposition
[2024-05-29 00:37:34] [INFO ] Flatten gal took : 27 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/graph14911396168701253048.txt' '-o' '/tmp/graph14911396168701253048.bin' '-w' '/tmp/graph14911396168701253048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14911396168701253048.bin' '-l' '-1' '-v' '-w' '/tmp/graph14911396168701253048.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:37:34] [INFO ] Decomposing Gal with order
[2024-05-29 00:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:37:34] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-29 00:37:34] [INFO ] Flatten gal took : 42 ms
[2024-05-29 00:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 8 ms.
[2024-05-29 00:37:34] [INFO ] Time to serialize gal into /tmp/LTL3473243075583945838.gal : 6 ms
[2024-05-29 00:37:34] [INFO ] Time to serialize properties into /tmp/LTL14758991310588203047.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/LTL3473243075583945838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14758991310588203047.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 : !((F(((F("((i34.u312.p2070==1)&&(i35.i1.u324.p2148==1))"))U(G("(i28.i2.u258.p1720==1)")))&&((F(G("(i9.i2.u85.p593==1)")))||("((i34.u31...197
Formula 0 simplified : G((G!"((i34.u312.p2070==1)&&(i35.i1.u324.p2148==1))" R F!"(i28.i2.u258.p1720==1)") | (!"((i34.u312.p2070==1)&&(i35.i1.u324.p2148==1)...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1498829653724693127
[2024-05-29 00:37:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1498829653724693127
Running compilation step : cd /tmp/ltsmin1498829653724693127;'/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 1683 ms.
Running link step : cd /tmp/ltsmin1498829653724693127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1498829653724693127;'/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)) U []((LTLAPp1==true)))&&(<>([]((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-09 finished in 188306 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||F(((!p1&&X(X(F(p2))))||G(F(p2)))))))'
Support contains 8 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 142 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:38:04] [INFO ] Computed 361 invariants in 12 ms
[2024-05-29 00:38:05] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-29 00:38:05] [INFO ] Invariant cache hit.
[2024-05-29 00:38:08] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3158 ms to find 0 implicit places.
[2024-05-29 00:38:08] [INFO ] Invariant cache hit.
[2024-05-29 00:38:09] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4586 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p2), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s2065 1), p1:(AND (EQ s274 1) (EQ s290 1) (EQ s301 1)), p2:(OR (NOT (AND (EQ s1574 1) (EQ s1590 1) (EQ s1601 1))) (NEQ s108 1))], 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 25011 reset in 700 ms.
Product exploration explored 100000 steps with 25021 reset in 680 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 00:38:11] [INFO ] Invariant cache hit.
[2024-05-29 00:38:12] [INFO ] [Real]Absence check using 361 positive place invariants in 127 ms returned sat
[2024-05-29 00:38:13] [INFO ] After 1898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 00:38:13] [INFO ] [Nat]Absence check using 361 positive place invariants in 121 ms returned sat
[2024-05-29 00:38:15] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 00:38:16] [INFO ] Deduced a trap composed of 33 places in 481 ms of which 1 ms to minimize.
[2024-05-29 00:38:16] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 1 ms to minimize.
[2024-05-29 00:38:17] [INFO ] Deduced a trap composed of 21 places in 455 ms of which 1 ms to minimize.
[2024-05-29 00:38:17] [INFO ] Deduced a trap composed of 47 places in 428 ms of which 1 ms to minimize.
[2024-05-29 00:38:18] [INFO ] Deduced a trap composed of 23 places in 447 ms of which 1 ms to minimize.
[2024-05-29 00:38:18] [INFO ] Deduced a trap composed of 31 places in 493 ms of which 1 ms to minimize.
[2024-05-29 00:38:19] [INFO ] Deduced a trap composed of 40 places in 502 ms of which 1 ms to minimize.
[2024-05-29 00:38:19] [INFO ] Deduced a trap composed of 33 places in 483 ms of which 1 ms to minimize.
[2024-05-29 00:38:20] [INFO ] Deduced a trap composed of 36 places in 439 ms of which 2 ms to minimize.
[2024-05-29 00:38:20] [INFO ] Deduced a trap composed of 42 places in 473 ms of which 1 ms to minimize.
[2024-05-29 00:38:21] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
[2024-05-29 00:38:21] [INFO ] Deduced a trap composed of 36 places in 463 ms of which 1 ms to minimize.
[2024-05-29 00:38:22] [INFO ] Deduced a trap composed of 36 places in 483 ms of which 2 ms to minimize.
[2024-05-29 00:38:23] [INFO ] Deduced a trap composed of 38 places in 456 ms of which 1 ms to minimize.
[2024-05-29 00:38:23] [INFO ] Deduced a trap composed of 36 places in 455 ms of which 1 ms to minimize.
[2024-05-29 00:38:24] [INFO ] Deduced a trap composed of 32 places in 449 ms of which 1 ms to minimize.
[2024-05-29 00:38:24] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 1 ms to minimize.
[2024-05-29 00:38:25] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 1 ms to minimize.
[2024-05-29 00:38:25] [INFO ] Deduced a trap composed of 32 places in 427 ms of which 1 ms to minimize.
[2024-05-29 00:38:26] [INFO ] Deduced a trap composed of 51 places in 432 ms of which 1 ms to minimize.
[2024-05-29 00:38:26] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 1 ms to minimize.
[2024-05-29 00:38:27] [INFO ] Deduced a trap composed of 36 places in 386 ms of which 1 ms to minimize.
[2024-05-29 00:38:27] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2024-05-29 00:38:27] [INFO ] Deduced a trap composed of 43 places in 374 ms of which 1 ms to minimize.
[2024-05-29 00:38:28] [INFO ] Deduced a trap composed of 46 places in 415 ms of which 1 ms to minimize.
[2024-05-29 00:38:28] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 1 ms to minimize.
[2024-05-29 00:38:29] [INFO ] Deduced a trap composed of 35 places in 449 ms of which 2 ms to minimize.
[2024-05-29 00:38:29] [INFO ] Deduced a trap composed of 28 places in 370 ms of which 1 ms to minimize.
[2024-05-29 00:38:30] [INFO ] Deduced a trap composed of 34 places in 396 ms of which 1 ms to minimize.
[2024-05-29 00:38:30] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 1 ms to minimize.
[2024-05-29 00:38:31] [INFO ] Deduced a trap composed of 37 places in 338 ms of which 1 ms to minimize.
[2024-05-29 00:38:31] [INFO ] Deduced a trap composed of 41 places in 377 ms of which 1 ms to minimize.
[2024-05-29 00:38:32] [INFO ] Deduced a trap composed of 47 places in 394 ms of which 1 ms to minimize.
[2024-05-29 00:38:32] [INFO ] Deduced a trap composed of 39 places in 347 ms of which 1 ms to minimize.
[2024-05-29 00:38:32] [INFO ] Deduced a trap composed of 45 places in 339 ms of which 1 ms to minimize.
[2024-05-29 00:38:33] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 1 ms to minimize.
[2024-05-29 00:38:33] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 0 ms to minimize.
[2024-05-29 00:38:34] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 1 ms to minimize.
[2024-05-29 00:38:34] [INFO ] Deduced a trap composed of 49 places in 313 ms of which 1 ms to minimize.
[2024-05-29 00:38:34] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 1 ms to minimize.
[2024-05-29 00:38:35] [INFO ] Deduced a trap composed of 46 places in 326 ms of which 0 ms to minimize.
[2024-05-29 00:38:35] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 1 ms to minimize.
[2024-05-29 00:38:36] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 0 ms to minimize.
[2024-05-29 00:38:36] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 1 ms to minimize.
[2024-05-29 00:38:36] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 1 ms to minimize.
[2024-05-29 00:38:37] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 0 ms to minimize.
[2024-05-29 00:38:37] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 1 ms to minimize.
[2024-05-29 00:38:37] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 1 ms to minimize.
[2024-05-29 00:38:38] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 1 ms to minimize.
[2024-05-29 00:38:38] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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 00:38:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 00:38:38] [INFO ] After 25100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 489 ms.
Support contains 8 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2122 transition count 1883
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1923 transition count 1883
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1923 transition count 1683
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1723 transition count 1683
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 2 with 1434 rules applied. Total rules applied 2232 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 274 times.
Drop transitions removed 274 transitions
Iterating global reduction 2 with 274 rules applied. Total rules applied 2506 place count 1006 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2507 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2508 place count 1004 transition count 965
Applied a total of 2508 rules in 197 ms. Remains 1004 /2122 variables (removed 1118) and now considering 965/2082 (removed 1117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 1004/2122 places, 965/2082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:38:39] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:38:39] [INFO ] [Real]Absence check using 359 positive place invariants in 58 ms returned sat
[2024-05-29 00:38:39] [INFO ] [Real]Absence check using 359 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 00:38:40] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 00:38:40] [INFO ] [Nat]Absence check using 359 positive place invariants in 57 ms returned sat
[2024-05-29 00:38:40] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 00:38:41] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 00:38:41] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2024-05-29 00:38:41] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-29 00:38:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2024-05-29 00:38:41] [INFO ] After 1076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-05-29 00:38:42] [INFO ] After 1554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 120 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 22 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1004/1004 places, 965/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 00:38:42] [INFO ] Invariant cache hit.
[2024-05-29 00:38:42] [INFO ] [Real]Absence check using 359 positive place invariants in 56 ms returned sat
[2024-05-29 00:38:42] [INFO ] [Real]Absence check using 359 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 00:38:43] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 00:38:43] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2024-05-29 00:38:43] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 00:38:43] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 00:38:44] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:38:44] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 00:38:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2024-05-29 00:38:44] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 00:38:44] [INFO ] After 1044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1004/1004 places, 965/965 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Finished probabilistic random walk after 80044 steps, run visited all 2 properties in 1233 ms. (steps per millisecond=64 )
Probabilistic random walk after 80044 steps, saw 78301 distinct states, run finished after 1233 ms. (steps per millisecond=64 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 p1)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 382 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Support contains 8 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 87 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:38:46] [INFO ] Computed 361 invariants in 8 ms
[2024-05-29 00:38:47] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-05-29 00:38:47] [INFO ] Invariant cache hit.
[2024-05-29 00:38:49] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2968 ms to find 0 implicit places.
[2024-05-29 00:38:49] [INFO ] Invariant cache hit.
[2024-05-29 00:38:50] [INFO ] Dead Transitions using invariants and state equation in 1268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4325 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 00:38:51] [INFO ] Invariant cache hit.
[2024-05-29 00:38:52] [INFO ] [Real]Absence check using 361 positive place invariants in 121 ms returned sat
[2024-05-29 00:38:53] [INFO ] After 1834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 00:38:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 121 ms returned sat
[2024-05-29 00:38:55] [INFO ] After 1330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 00:38:56] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 2 ms to minimize.
[2024-05-29 00:38:56] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 1 ms to minimize.
[2024-05-29 00:38:57] [INFO ] Deduced a trap composed of 21 places in 462 ms of which 1 ms to minimize.
[2024-05-29 00:38:57] [INFO ] Deduced a trap composed of 47 places in 423 ms of which 1 ms to minimize.
[2024-05-29 00:38:58] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 1 ms to minimize.
[2024-05-29 00:38:58] [INFO ] Deduced a trap composed of 31 places in 450 ms of which 1 ms to minimize.
[2024-05-29 00:38:59] [INFO ] Deduced a trap composed of 40 places in 466 ms of which 1 ms to minimize.
[2024-05-29 00:38:59] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 1 ms to minimize.
[2024-05-29 00:39:00] [INFO ] Deduced a trap composed of 36 places in 444 ms of which 1 ms to minimize.
[2024-05-29 00:39:00] [INFO ] Deduced a trap composed of 42 places in 452 ms of which 2 ms to minimize.
[2024-05-29 00:39:01] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 1 ms to minimize.
[2024-05-29 00:39:01] [INFO ] Deduced a trap composed of 36 places in 428 ms of which 1 ms to minimize.
[2024-05-29 00:39:02] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 1 ms to minimize.
[2024-05-29 00:39:02] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 1 ms to minimize.
[2024-05-29 00:39:03] [INFO ] Deduced a trap composed of 36 places in 430 ms of which 1 ms to minimize.
[2024-05-29 00:39:03] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 1 ms to minimize.
[2024-05-29 00:39:04] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 1 ms to minimize.
[2024-05-29 00:39:04] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 1 ms to minimize.
[2024-05-29 00:39:05] [INFO ] Deduced a trap composed of 32 places in 417 ms of which 1 ms to minimize.
[2024-05-29 00:39:05] [INFO ] Deduced a trap composed of 51 places in 395 ms of which 1 ms to minimize.
[2024-05-29 00:39:06] [INFO ] Deduced a trap composed of 36 places in 409 ms of which 1 ms to minimize.
[2024-05-29 00:39:06] [INFO ] Deduced a trap composed of 36 places in 408 ms of which 1 ms to minimize.
[2024-05-29 00:39:07] [INFO ] Deduced a trap composed of 35 places in 412 ms of which 1 ms to minimize.
[2024-05-29 00:39:07] [INFO ] Deduced a trap composed of 43 places in 402 ms of which 1 ms to minimize.
[2024-05-29 00:39:08] [INFO ] Deduced a trap composed of 46 places in 392 ms of which 1 ms to minimize.
[2024-05-29 00:39:08] [INFO ] Deduced a trap composed of 32 places in 398 ms of which 1 ms to minimize.
[2024-05-29 00:39:08] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 1 ms to minimize.
[2024-05-29 00:39:09] [INFO ] Deduced a trap composed of 28 places in 365 ms of which 0 ms to minimize.
[2024-05-29 00:39:09] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 1 ms to minimize.
[2024-05-29 00:39:10] [INFO ] Deduced a trap composed of 40 places in 379 ms of which 1 ms to minimize.
[2024-05-29 00:39:10] [INFO ] Deduced a trap composed of 37 places in 357 ms of which 1 ms to minimize.
[2024-05-29 00:39:11] [INFO ] Deduced a trap composed of 41 places in 359 ms of which 1 ms to minimize.
[2024-05-29 00:39:11] [INFO ] Deduced a trap composed of 47 places in 380 ms of which 1 ms to minimize.
[2024-05-29 00:39:11] [INFO ] Deduced a trap composed of 39 places in 329 ms of which 1 ms to minimize.
[2024-05-29 00:39:12] [INFO ] Deduced a trap composed of 45 places in 335 ms of which 1 ms to minimize.
[2024-05-29 00:39:12] [INFO ] Deduced a trap composed of 43 places in 344 ms of which 1 ms to minimize.
[2024-05-29 00:39:13] [INFO ] Deduced a trap composed of 37 places in 332 ms of which 1 ms to minimize.
[2024-05-29 00:39:13] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 2 ms to minimize.
[2024-05-29 00:39:14] [INFO ] Deduced a trap composed of 49 places in 341 ms of which 1 ms to minimize.
[2024-05-29 00:39:14] [INFO ] Deduced a trap composed of 53 places in 337 ms of which 1 ms to minimize.
[2024-05-29 00:39:14] [INFO ] Deduced a trap composed of 46 places in 343 ms of which 5 ms to minimize.
[2024-05-29 00:39:15] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 1 ms to minimize.
[2024-05-29 00:39:15] [INFO ] Deduced a trap composed of 45 places in 299 ms of which 1 ms to minimize.
[2024-05-29 00:39:15] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 1 ms to minimize.
[2024-05-29 00:39:16] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 2 ms to minimize.
[2024-05-29 00:39:16] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 0 ms to minimize.
[2024-05-29 00:39:17] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 1 ms to minimize.
[2024-05-29 00:39:17] [INFO ] Deduced a trap composed of 55 places in 282 ms of which 1 ms to minimize.
[2024-05-29 00:39:17] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 1 ms to minimize.
[2024-05-29 00:39:18] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 0 ms to minimize.
[2024-05-29 00:39:18] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 1 ms to minimize.
[2024-05-29 00:39:18] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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: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 00:39:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 00:39:18] [INFO ] After 25288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 264 ms.
Support contains 8 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2122 transition count 1883
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1923 transition count 1883
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1923 transition count 1683
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1723 transition count 1683
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 2 with 1434 rules applied. Total rules applied 2232 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 274 times.
Drop transitions removed 274 transitions
Iterating global reduction 2 with 274 rules applied. Total rules applied 2506 place count 1006 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2507 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2508 place count 1004 transition count 965
Applied a total of 2508 rules in 198 ms. Remains 1004 /2122 variables (removed 1118) and now considering 965/2082 (removed 1117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 1004/2122 places, 965/2082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:39:19] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:39:20] [INFO ] [Real]Absence check using 359 positive place invariants in 63 ms returned sat
[2024-05-29 00:39:20] [INFO ] [Real]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 00:39:20] [INFO ] After 800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 00:39:20] [INFO ] [Nat]Absence check using 359 positive place invariants in 57 ms returned sat
[2024-05-29 00:39:20] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 00:39:21] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 00:39:21] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2024-05-29 00:39:21] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 00:39:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2024-05-29 00:39:21] [INFO ] After 1117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-05-29 00:39:22] [INFO ] After 1618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 126 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1004/1004 places, 965/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Finished probabilistic random walk after 80044 steps, run visited all 5 properties in 1446 ms. (steps per millisecond=55 )
Probabilistic random walk after 80044 steps, saw 78301 distinct states, run finished after 1446 ms. (steps per millisecond=55 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 p1)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 398 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 25034 reset in 690 ms.
Product exploration explored 100000 steps with 24971 reset in 698 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Support contains 8 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2122 transition count 2082
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 198 place count 2122 transition count 2084
Deduced a syphon composed of 280 places in 3 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 280 place count 2122 transition count 2084
Performed 836 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 1 with 836 rules applied. Total rules applied 1116 place count 2122 transition count 2084
Renaming transitions due to excessive name length > 1024 char.
Discarding 277 places :
Symmetric choice reduction at 1 with 277 rule applications. Total rules 1393 place count 1845 transition count 1807
Deduced a syphon composed of 839 places in 2 ms
Iterating global reduction 1 with 277 rules applied. Total rules applied 1670 place count 1845 transition count 1807
Deduced a syphon composed of 839 places in 1 ms
Applied a total of 1670 rules in 414 ms. Remains 1845 /2122 variables (removed 277) and now considering 1807/2082 (removed 275) transitions.
[2024-05-29 00:39:27] [INFO ] Redundant transitions in 136 ms returned [1806]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1806 rows 1845 cols
[2024-05-29 00:39:27] [INFO ] Computed 361 invariants in 23 ms
[2024-05-29 00:39:28] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/2122 places, 1806/2082 transitions.
Deduced a syphon composed of 839 places in 2 ms
Applied a total of 0 rules in 51 ms. Remains 1845 /1845 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1756 ms. Remains : 1845/2122 places, 1806/2082 transitions.
Built C files in :
/tmp/ltsmin10308786681745855462
[2024-05-29 00:39:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10308786681745855462
Running compilation step : cd /tmp/ltsmin10308786681745855462;'/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/ltsmin10308786681745855462;'/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/ltsmin10308786681745855462;'/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 8 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 72 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-29 00:39:31] [INFO ] Computed 361 invariants in 11 ms
[2024-05-29 00:39:32] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-29 00:39:32] [INFO ] Invariant cache hit.
[2024-05-29 00:39:34] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 2952 ms to find 0 implicit places.
[2024-05-29 00:39:34] [INFO ] Invariant cache hit.
[2024-05-29 00:39:35] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4352 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin3851296944304019879
[2024-05-29 00:39:35] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3851296944304019879
Running compilation step : cd /tmp/ltsmin3851296944304019879;'/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/ltsmin3851296944304019879;'/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/ltsmin3851296944304019879;'/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 00:39:39] [INFO ] Flatten gal took : 44 ms
[2024-05-29 00:39:39] [INFO ] Flatten gal took : 45 ms
[2024-05-29 00:39:39] [INFO ] Time to serialize gal into /tmp/LTL11484575323152941478.gal : 12 ms
[2024-05-29 00:39:39] [INFO ] Time to serialize properties into /tmp/LTL16416928865802416882.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/LTL11484575323152941478.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12588770693986648029.hoa' '-atoms' '/tmp/LTL16416928865802416882.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/LTL16416928865802416882.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12588770693986648029.hoa
Detected timeout of ITS tools.
[2024-05-29 00:39:54] [INFO ] Flatten gal took : 45 ms
[2024-05-29 00:39:54] [INFO ] Flatten gal took : 45 ms
[2024-05-29 00:39:54] [INFO ] Time to serialize gal into /tmp/LTL3309982859172767784.gal : 8 ms
[2024-05-29 00:39:54] [INFO ] Time to serialize properties into /tmp/LTL9245205980206408900.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/LTL3309982859172767784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9245205980206408900.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(("(p2336==1)")||(F((G(F("(((p1777!=1)||(p1796!=1))||((p1810!=1)||(p115!=1)))")))||(("(((p302!=1)||(p321!=1))||(p335!=1))")&&(X(X(...220
Formula 0 simplified : F(!"(p2336==1)" & G(FG!"(((p1777!=1)||(p1796!=1))||((p1810!=1)||(p115!=1)))" & (!"(((p302!=1)||(p321!=1))||(p335!=1))" | XXG!"(((p17...204
Detected timeout of ITS tools.
[2024-05-29 00:40:09] [INFO ] Flatten gal took : 46 ms
[2024-05-29 00:40:09] [INFO ] Applying decomposition
[2024-05-29 00:40:09] [INFO ] Flatten gal took : 45 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/graph18386147755532751959.txt' '-o' '/tmp/graph18386147755532751959.bin' '-w' '/tmp/graph18386147755532751959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18386147755532751959.bin' '-l' '-1' '-v' '-w' '/tmp/graph18386147755532751959.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:40:09] [INFO ] Decomposing Gal with order
[2024-05-29 00:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:40:09] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-29 00:40:09] [INFO ] Flatten gal took : 78 ms
[2024-05-29 00:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-29 00:40:09] [INFO ] Time to serialize gal into /tmp/LTL3367636075461170354.gal : 18 ms
[2024-05-29 00:40:09] [INFO ] Time to serialize properties into /tmp/LTL4744958826718698461.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/LTL3367636075461170354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4744958826718698461.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 : !((G(("(i39.i2.u781.p2336==1)")||(F((G(F("(((i29.i6.u596.p1777!=1)||(i29.i6.u602.p1796!=1))||((i29.i6.u606.p1810!=1)||(i1.i3.u44.p115!...357
Formula 0 simplified : F(!"(i39.i2.u781.p2336==1)" & G(FG!"(((i29.i6.u596.p1777!=1)||(i29.i6.u602.p1796!=1))||((i29.i6.u606.p1810!=1)||(i1.i3.u44.p115!=1))...341
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4016538373245138491
[2024-05-29 00:40:24] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4016538373245138491
Running compilation step : cd /tmp/ltsmin4016538373245138491;'/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/ltsmin4016538373245138491;'/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/ltsmin4016538373245138491;'/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)
Treatment of property ShieldIIPs-PT-040B-LTLFireability-11 finished in 143161 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 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2131 transition count 1891
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1931 transition count 1891
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1931 transition count 1690
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1730 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 811 place count 1721 transition count 1681
Iterating global reduction 2 with 9 rules applied. Total rules applied 820 place count 1721 transition count 1681
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 820 place count 1721 transition count 1675
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 832 place count 1715 transition count 1675
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 3 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2254 place count 1004 transition count 964
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 2256 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1001 transition count 962
Applied a total of 2257 rules in 248 ms. Remains 1001 /2132 variables (removed 1131) and now considering 962/2092 (removed 1130) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-29 00:40:28] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:40:28] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-29 00:40:28] [INFO ] Invariant cache hit.
[2024-05-29 00:40:29] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2024-05-29 00:40:29] [INFO ] Redundant transitions in 101 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:40:29] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:40:30] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2132 places, 961/2092 transitions.
Applied a total of 0 rules in 17 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2483 ms. Remains : 1001/2132 places, 961/2092 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s349 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 48 reset in 772 ms.
Product exploration explored 100000 steps with 48 reset in 953 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/1001 stabilizing places and 2/961 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 267 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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 194 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:40:32] [INFO ] Invariant cache hit.
[2024-05-29 00:40:33] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-29 00:40:33] [INFO ] Invariant cache hit.
[2024-05-29 00:40:34] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2024-05-29 00:40:34] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-29 00:40:34] [INFO ] Invariant cache hit.
[2024-05-29 00:40:35] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2224 ms. Remains : 1001/1001 places, 961/961 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/1001 stabilizing places and 2/961 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 172 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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 213 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 48 reset in 756 ms.
Product exploration explored 100000 steps with 48 reset in 941 ms.
Built C files in :
/tmp/ltsmin475529798721660086
[2024-05-29 00:40:37] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-29 00:40:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:40:37] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-29 00:40:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:40:37] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-29 00:40:37] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:40:37] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin475529798721660086
Running compilation step : cd /tmp/ltsmin475529798721660086;'/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 2737 ms.
Running link step : cd /tmp/ltsmin475529798721660086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin475529798721660086;'/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' '--hoa' '/tmp/stateBased40608920636090700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 22 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:40:52] [INFO ] Invariant cache hit.
[2024-05-29 00:40:52] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-29 00:40:52] [INFO ] Invariant cache hit.
[2024-05-29 00:40:53] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
[2024-05-29 00:40:53] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-29 00:40:53] [INFO ] Invariant cache hit.
[2024-05-29 00:40:54] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2170 ms. Remains : 1001/1001 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin11180763837080874162
[2024-05-29 00:40:54] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-29 00:40:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:40:54] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-29 00:40:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:40:54] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-29 00:40:54] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:40:54] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11180763837080874162
Running compilation step : cd /tmp/ltsmin11180763837080874162;'/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 2744 ms.
Running link step : cd /tmp/ltsmin11180763837080874162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin11180763837080874162;'/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' '--hoa' '/tmp/stateBased18033908186892892864.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:41:09] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:41:09] [INFO ] Flatten gal took : 26 ms
[2024-05-29 00:41:09] [INFO ] Time to serialize gal into /tmp/LTL5886668095491304590.gal : 4 ms
[2024-05-29 00:41:09] [INFO ] Time to serialize properties into /tmp/LTL14227242279849661796.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/LTL5886668095491304590.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5630829336682001390.hoa' '-atoms' '/tmp/LTL14227242279849661796.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/LTL14227242279849661796.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5630829336682001390.hoa
Detected timeout of ITS tools.
[2024-05-29 00:41:24] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:41:24] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:41:24] [INFO ] Time to serialize gal into /tmp/LTL7895285602550103154.gal : 6 ms
[2024-05-29 00:41:24] [INFO ] Time to serialize properties into /tmp/LTL4449732192944545072.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/LTL7895285602550103154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4449732192944545072.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 : !((F(G("(p857!=1)"))))
Formula 0 simplified : GF!"(p857!=1)"
Detected timeout of ITS tools.
[2024-05-29 00:41:39] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:41:39] [INFO ] Applying decomposition
[2024-05-29 00:41:39] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5215848745774653139.txt' '-o' '/tmp/graph5215848745774653139.bin' '-w' '/tmp/graph5215848745774653139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5215848745774653139.bin' '-l' '-1' '-v' '-w' '/tmp/graph5215848745774653139.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:41:39] [INFO ] Decomposing Gal with order
[2024-05-29 00:41:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:41:39] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-29 00:41:39] [INFO ] Flatten gal took : 41 ms
[2024-05-29 00:41:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 590 labels/synchronizations in 6 ms.
[2024-05-29 00:41:39] [INFO ] Time to serialize gal into /tmp/LTL13760674548900503721.gal : 7 ms
[2024-05-29 00:41:39] [INFO ] Time to serialize properties into /tmp/LTL6979395328762003091.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/LTL13760674548900503721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6979395328762003091.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 : !((F(G("(i13.i2.u125.p857!=1)"))))
Formula 0 simplified : GF!"(i13.i2.u125.p857!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9900254721475952866
[2024-05-29 00:41:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9900254721475952866
Running compilation step : cd /tmp/ltsmin9900254721475952866;'/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 1710 ms.
Running link step : cd /tmp/ltsmin9900254721475952866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9900254721475952866;'/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-040B-LTLFireability-12 finished in 102147 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)||F(G(p1))) U !p1))'
Support contains 2 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2131 transition count 1891
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1931 transition count 1891
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1931 transition count 1690
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1730 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 811 place count 1721 transition count 1681
Iterating global reduction 2 with 9 rules applied. Total rules applied 820 place count 1721 transition count 1681
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 820 place count 1721 transition count 1675
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 832 place count 1715 transition count 1675
Performed 709 Post agglomeration using F-continuation condition.Transition count delta: 709
Deduced a syphon composed of 709 places in 2 ms
Reduce places removed 709 places and 0 transitions.
Iterating global reduction 2 with 1418 rules applied. Total rules applied 2250 place count 1006 transition count 966
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 2252 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1003 transition count 964
Applied a total of 2253 rules in 250 ms. Remains 1003 /2132 variables (removed 1129) and now considering 964/2092 (removed 1128) transitions.
// Phase 1: matrix 964 rows 1003 cols
[2024-05-29 00:42:10] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:42:10] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-29 00:42:10] [INFO ] Invariant cache hit.
[2024-05-29 00:42:11] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-05-29 00:42:11] [INFO ] Redundant transitions in 101 ms returned [963]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:42:11] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:42:12] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2132 places, 963/2092 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2435 ms. Remains : 1003/2132 places, 963/2092 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s1 1), p0:(NEQ s730 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 66 reset in 771 ms.
Product exploration explored 100000 steps with 66 reset in 934 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/1003 stabilizing places and 4/963 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 547 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 4 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 675 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-29 00:42:15] [INFO ] Invariant cache hit.
[2024-05-29 00:42:16] [INFO ] [Real]Absence check using 360 positive place invariants in 196 ms returned sat
[2024-05-29 00:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:42:19] [INFO ] [Real]Absence check using state equation in 2418 ms returned sat
[2024-05-29 00:42:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:42:19] [INFO ] [Nat]Absence check using 360 positive place invariants in 168 ms returned sat
[2024-05-29 00:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:42:22] [INFO ] [Nat]Absence check using state equation in 2089 ms returned sat
[2024-05-29 00:42:22] [INFO ] Computed and/alt/rep : 951/2489/951 causal constraints (skipped 9 transitions) in 52 ms.
[2024-05-29 00:42:34] [INFO ] Added : 580 causal constraints over 116 iterations in 12172 ms. Result :unknown
Could not prove EG p1
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 26 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:42:34] [INFO ] Invariant cache hit.
[2024-05-29 00:42:34] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 00:42:34] [INFO ] Invariant cache hit.
[2024-05-29 00:42:35] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
[2024-05-29 00:42:35] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-29 00:42:35] [INFO ] Invariant cache hit.
[2024-05-29 00:42:36] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2206 ms. Remains : 1003/1003 places, 963/963 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/1003 stabilizing places and 4/963 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 530 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 670 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-29 00:42:37] [INFO ] Invariant cache hit.
[2024-05-29 00:42:38] [INFO ] [Real]Absence check using 360 positive place invariants in 188 ms returned sat
[2024-05-29 00:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:42:41] [INFO ] [Real]Absence check using state equation in 2322 ms returned sat
[2024-05-29 00:42:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:42:41] [INFO ] [Nat]Absence check using 360 positive place invariants in 173 ms returned sat
[2024-05-29 00:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:42:43] [INFO ] [Nat]Absence check using state equation in 2009 ms returned sat
[2024-05-29 00:42:43] [INFO ] Computed and/alt/rep : 951/2489/951 causal constraints (skipped 9 transitions) in 58 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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 00:42:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p1
Could not prove EG p1
Stuttering acceptance computed with spot in 104 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 57 reset in 761 ms.
Product exploration explored 100000 steps with 64 reset in 931 ms.
Built C files in :
/tmp/ltsmin16477021291060586353
[2024-05-29 00:42:57] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2024-05-29 00:42:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:42:57] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2024-05-29 00:42:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:42:58] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2024-05-29 00:42:58] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:42:58] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16477021291060586353
Running compilation step : cd /tmp/ltsmin16477021291060586353;'/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 2726 ms.
Running link step : cd /tmp/ltsmin16477021291060586353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin16477021291060586353;'/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' '--hoa' '/tmp/stateBased13909477755435049084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-29 00:43:12] [INFO ] Invariant cache hit.
[2024-05-29 00:43:13] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 00:43:13] [INFO ] Invariant cache hit.
[2024-05-29 00:43:14] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2024-05-29 00:43:14] [INFO ] Redundant transitions in 115 ms returned []
[2024-05-29 00:43:14] [INFO ] Invariant cache hit.
[2024-05-29 00:43:15] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2299 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin5843512908968869372
[2024-05-29 00:43:15] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2024-05-29 00:43:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:43:15] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2024-05-29 00:43:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:43:15] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2024-05-29 00:43:15] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:43:15] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5843512908968869372
Running compilation step : cd /tmp/ltsmin5843512908968869372;'/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 2751 ms.
Running link step : cd /tmp/ltsmin5843512908968869372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5843512908968869372;'/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' '--hoa' '/tmp/stateBased10314494190690055404.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:43:30] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:43:30] [INFO ] Flatten gal took : 26 ms
[2024-05-29 00:43:30] [INFO ] Time to serialize gal into /tmp/LTL16019926055585288405.gal : 4 ms
[2024-05-29 00:43:30] [INFO ] Time to serialize properties into /tmp/LTL17677619322657333058.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/LTL16019926055585288405.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5546078698541033987.hoa' '-atoms' '/tmp/LTL17677619322657333058.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/LTL17677619322657333058.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5546078698541033987.hoa
Detected timeout of ITS tools.
[2024-05-29 00:43:45] [INFO ] Flatten gal took : 33 ms
[2024-05-29 00:43:45] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:43:45] [INFO ] Time to serialize gal into /tmp/LTL15248567375872979821.gal : 4 ms
[2024-05-29 00:43:45] [INFO ] Time to serialize properties into /tmp/LTL596233181021525705.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/LTL15248567375872979821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL596233181021525705.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("(p1753!=1)"))||(F(G("(p36!=1)"))))U("(p36==1)")))
Formula 0 simplified : (F!"(p1753!=1)" & GF!"(p36!=1)") R !"(p36==1)"
Detected timeout of ITS tools.
[2024-05-29 00:44:00] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:44:00] [INFO ] Applying decomposition
[2024-05-29 00:44:00] [INFO ] Flatten gal took : 27 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/graph10781887851858325447.txt' '-o' '/tmp/graph10781887851858325447.bin' '-w' '/tmp/graph10781887851858325447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10781887851858325447.bin' '-l' '-1' '-v' '-w' '/tmp/graph10781887851858325447.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:44:00] [INFO ] Decomposing Gal with order
[2024-05-29 00:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:44:00] [INFO ] Removed a total of 638 redundant transitions.
[2024-05-29 00:44:00] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 8 ms.
[2024-05-29 00:44:00] [INFO ] Time to serialize gal into /tmp/LTL16384655011320305534.gal : 7 ms
[2024-05-29 00:44:00] [INFO ] Time to serialize properties into /tmp/LTL4906389021225268225.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/LTL16384655011320305534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4906389021225268225.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("(i28.i2.u263.p1753!=1)"))||(F(G("(i4.i0.u0.p36!=1)"))))U("(i4.i0.u0.p36==1)")))
Formula 0 simplified : (F!"(i28.i2.u263.p1753!=1)" & GF!"(i4.i0.u0.p36!=1)") R !"(i4.i0.u0.p36==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2832007052648077417
[2024-05-29 00:44:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2832007052648077417
Running compilation step : cd /tmp/ltsmin2832007052648077417;'/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 1676 ms.
Running link step : cd /tmp/ltsmin2832007052648077417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2832007052648077417;'/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)))) U !(LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-14 finished in 140893 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) U (X(!p1)||p2))&&X(p0))||p2) U !p1))'
Support contains 3 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2124 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2124 transition count 2084
Applied a total of 16 rules in 139 ms. Remains 2124 /2132 variables (removed 8) and now considering 2084/2092 (removed 8) transitions.
// Phase 1: matrix 2084 rows 2124 cols
[2024-05-29 00:44:31] [INFO ] Computed 361 invariants in 13 ms
[2024-05-29 00:44:31] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-05-29 00:44:31] [INFO ] Invariant cache hit.
[2024-05-29 00:44:34] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 2949 ms to find 0 implicit places.
[2024-05-29 00:44:34] [INFO ] Invariant cache hit.
[2024-05-29 00:44:35] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2124/2132 places, 2084/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4306 ms. Remains : 2124/2132 places, 2084/2092 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s1075 1), p1:(NEQ s762 1), p2:(EQ s187 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1198 ms.
Product exploration explored 100000 steps with 50000 reset in 1230 ms.
Computed a total of 481 stabilizing places and 481 stable transitions
Computed a total of 481 stabilizing places and 481 stable transitions
Detected a total of 481/2124 stabilizing places and 481/2084 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 23 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-15 finished in 7013 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&&(!p0 U (X(p1)||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((p0||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' '!(G(F(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' '!(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' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040B-LTLFireability-06
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1930 transition count 1689
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1729 transition count 1689
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 814 place count 1719 transition count 1679
Iterating global reduction 2 with 10 rules applied. Total rules applied 824 place count 1719 transition count 1679
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 824 place count 1719 transition count 1672
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 838 place count 1712 transition count 1672
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 2 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2254 place count 1004 transition count 964
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 2256 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1001 transition count 962
Applied a total of 2257 rules in 285 ms. Remains 1001 /2132 variables (removed 1131) and now considering 962/2092 (removed 1130) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-29 00:44:38] [INFO ] Computed 360 invariants in 3 ms
[2024-05-29 00:44:39] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-29 00:44:39] [INFO ] Invariant cache hit.
[2024-05-29 00:44:40] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
[2024-05-29 00:44:40] [INFO ] Invariant cache hit.
[2024-05-29 00:44:40] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1001/2132 places, 962/2092 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2368 ms. Remains : 1001/2132 places, 962/2092 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s228 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1936 steps with 2 reset in 15 ms.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-06 finished in 2606 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(p1)||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' '!(F(((F(p0) U G(p1))&&(p0||F(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((p0||F(((!p1&&X(X(F(p2))))||G(F(p2)))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Support contains 8 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2131 transition count 1892
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1932 transition count 1892
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1932 transition count 1692
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1732 transition count 1692
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 808 place count 1722 transition count 1682
Iterating global reduction 2 with 10 rules applied. Total rules applied 818 place count 1722 transition count 1682
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 818 place count 1722 transition count 1675
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 832 place count 1715 transition count 1675
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 2 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2248 place count 1007 transition count 967
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 2250 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1004 transition count 965
Applied a total of 2251 rules in 252 ms. Remains 1004 /2132 variables (removed 1128) and now considering 965/2092 (removed 1127) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:44:41] [INFO ] Computed 360 invariants in 2 ms
[2024-05-29 00:44:42] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-29 00:44:42] [INFO ] Invariant cache hit.
[2024-05-29 00:44:43] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2024-05-29 00:44:43] [INFO ] Invariant cache hit.
[2024-05-29 00:44:43] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1004/2132 places, 965/2092 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2270 ms. Remains : 1004/2132 places, 965/2092 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p2), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s978 1), p1:(AND (EQ s113 1) (EQ s122 1) (EQ s128 1)), p2:(OR (NOT (AND (EQ s739 1) (EQ s748 1) (EQ s754 1))) (NEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25069 reset in 840 ms.
Product exploration explored 100000 steps with 24910 reset in 988 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) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 00:44:46] [INFO ] Invariant cache hit.
[2024-05-29 00:44:46] [INFO ] [Real]Absence check using 360 positive place invariants in 59 ms returned sat
[2024-05-29 00:44:47] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 00:44:47] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:44:48] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 00:44:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 00:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-29 00:44:48] [INFO ] After 951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-29 00:44:48] [INFO ] After 1450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 106 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 1004 transition count 965
Applied a total of 234 rules in 38 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1004/1004 places, 965/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 142898 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{1=1}
Probabilistic random walk after 142898 steps, saw 139742 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:44:52] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:44:52] [INFO ] [Real]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:44:53] [INFO ] After 747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 00:44:53] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:44:53] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 00:44:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-29 00:44:54] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 00:44:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 00:44:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2024-05-29 00:44:54] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-29 00:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-29 00:44:54] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 00:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-29 00:44:54] [INFO ] After 1140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-29 00:44:54] [INFO ] After 1569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 68 ms.
Support contains 5 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1004 transition count 964
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 964
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1003 transition count 964
Applied a total of 3 rules in 37 ms. Remains 1003 /1004 variables (removed 1) and now considering 964/965 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1003/1004 places, 964/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 964 rows 1003 cols
[2024-05-29 00:44:55] [INFO ] Computed 360 invariants in 5 ms
[2024-05-29 00:44:55] [INFO ] [Real]Absence check using 360 positive place invariants in 59 ms returned sat
[2024-05-29 00:44:55] [INFO ] After 611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:44:55] [INFO ] [Nat]Absence check using 360 positive place invariants in 57 ms returned sat
[2024-05-29 00:44:56] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:44:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 00:44:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 00:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-29 00:44:56] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 00:44:56] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1003/1003 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298340 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298340 steps, saw 290564 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:44:59] [INFO ] Invariant cache hit.
[2024-05-29 00:44:59] [INFO ] [Real]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:45:00] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:45:00] [INFO ] [Nat]Absence check using 360 positive place invariants in 69 ms returned sat
[2024-05-29 00:45:01] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:45:01] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 00:45:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:45:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-05-29 00:45:01] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-29 00:45:01] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1003/1003 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-29 00:45:01] [INFO ] Invariant cache hit.
[2024-05-29 00:45:01] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-29 00:45:01] [INFO ] Invariant cache hit.
[2024-05-29 00:45:03] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2024-05-29 00:45:03] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 00:45:03] [INFO ] Invariant cache hit.
[2024-05-29 00:45:03] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2465 ms. Remains : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:45:03] [INFO ] Invariant cache hit.
[2024-05-29 00:45:03] [INFO ] [Real]Absence check using 360 positive place invariants in 59 ms returned sat
[2024-05-29 00:45:04] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:45:04] [INFO ] [Nat]Absence check using 360 positive place invariants in 61 ms returned sat
[2024-05-29 00:45:05] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:45:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 00:45:05] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
[2024-05-29 00:45:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2024-05-29 00:45:05] [INFO ] After 665ms 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 00:45:05] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 319 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:45:05] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:45:06] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-29 00:45:06] [INFO ] Invariant cache hit.
[2024-05-29 00:45:07] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
[2024-05-29 00:45:07] [INFO ] Invariant cache hit.
[2024-05-29 00:45:08] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2079 ms. Remains : 1004/1004 places, 965/965 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 00:45:08] [INFO ] Invariant cache hit.
[2024-05-29 00:45:09] [INFO ] [Real]Absence check using 360 positive place invariants in 63 ms returned sat
[2024-05-29 00:45:09] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 00:45:09] [INFO ] [Nat]Absence check using 360 positive place invariants in 62 ms returned sat
[2024-05-29 00:45:10] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 00:45:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 00:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-29 00:45:10] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-29 00:45:11] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 116 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 1004 transition count 965
Applied a total of 234 rules in 34 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1004/1004 places, 965/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:45:11] [INFO ] Computed 360 invariants in 10 ms
[2024-05-29 00:45:11] [INFO ] [Real]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:45:12] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 00:45:12] [INFO ] [Nat]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:45:12] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 00:45:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-29 00:45:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 00:45:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:45:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2024-05-29 00:45:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 00:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-29 00:45:13] [INFO ] After 882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 00:45:13] [INFO ] After 1183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 21 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1004/1004 places, 965/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 262600 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{0=1}
Probabilistic random walk after 262600 steps, saw 255795 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-29 00:45:16] [INFO ] Invariant cache hit.
[2024-05-29 00:45:17] [INFO ] [Real]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:45:17] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:45:17] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2024-05-29 00:45:18] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:45:18] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:45:18] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-29 00:45:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2024-05-29 00:45:18] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 00:45:18] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1004 transition count 964
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 964
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1003 transition count 964
Applied a total of 3 rules in 37 ms. Remains 1003 /1004 variables (removed 1) and now considering 964/965 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1003/1004 places, 964/965 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 296888 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296888 steps, saw 289151 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 964 rows 1003 cols
[2024-05-29 00:45:21] [INFO ] Computed 360 invariants in 6 ms
[2024-05-29 00:45:21] [INFO ] [Real]Absence check using 360 positive place invariants in 63 ms returned sat
[2024-05-29 00:45:22] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:45:22] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:45:22] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:45:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-29 00:45:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 00:45:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2024-05-29 00:45:22] [INFO ] After 614ms 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 00:45:23] [INFO ] After 859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1003/1003 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-29 00:45:23] [INFO ] Invariant cache hit.
[2024-05-29 00:45:23] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-05-29 00:45:23] [INFO ] Invariant cache hit.
[2024-05-29 00:45:25] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2024-05-29 00:45:25] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 00:45:25] [INFO ] Invariant cache hit.
[2024-05-29 00:45:25] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2551 ms. Remains : 1003/1003 places, 964/964 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:45:25] [INFO ] Invariant cache hit.
[2024-05-29 00:45:25] [INFO ] [Real]Absence check using 360 positive place invariants in 60 ms returned sat
[2024-05-29 00:45:26] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:45:26] [INFO ] [Nat]Absence check using 360 positive place invariants in 58 ms returned sat
[2024-05-29 00:45:26] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:45:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 00:45:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 00:45:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-05-29 00:45:27] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-29 00:45:27] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 474 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 25035 reset in 820 ms.
Product exploration explored 100000 steps with 25018 reset in 980 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 24 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
[2024-05-29 00:45:30] [INFO ] Redundant transitions in 107 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 964 rows 1004 cols
[2024-05-29 00:45:30] [INFO ] Computed 360 invariants in 1 ms
[2024-05-29 00:45:30] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/1004 places, 964/965 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 660 ms. Remains : 1004/1004 places, 964/965 transitions.
Built C files in :
/tmp/ltsmin12751117394073433055
[2024-05-29 00:45:30] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12751117394073433055
Running compilation step : cd /tmp/ltsmin12751117394073433055;'/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 1814 ms.
Running link step : cd /tmp/ltsmin12751117394073433055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12751117394073433055;'/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' '--hoa' '/tmp/stateBased6687732785131656567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-29 00:45:45] [INFO ] Computed 360 invariants in 4 ms
[2024-05-29 00:45:46] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-29 00:45:46] [INFO ] Invariant cache hit.
[2024-05-29 00:45:47] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2024-05-29 00:45:47] [INFO ] Invariant cache hit.
[2024-05-29 00:45:48] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2124 ms. Remains : 1004/1004 places, 965/965 transitions.
Built C files in :
/tmp/ltsmin7842054367058902767
[2024-05-29 00:45:48] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7842054367058902767
Running compilation step : cd /tmp/ltsmin7842054367058902767;'/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 1862 ms.
Running link step : cd /tmp/ltsmin7842054367058902767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7842054367058902767;'/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' '--hoa' '/tmp/stateBased2301164209265740476.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:46:03] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:46:03] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:46:03] [INFO ] Time to serialize gal into /tmp/LTL2106437550721253000.gal : 4 ms
[2024-05-29 00:46:03] [INFO ] Time to serialize properties into /tmp/LTL1850474088749583545.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/LTL2106437550721253000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9131918401620550683.hoa' '-atoms' '/tmp/LTL1850474088749583545.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/LTL1850474088749583545.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9131918401620550683.hoa
Detected timeout of ITS tools.
[2024-05-29 00:46:18] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:46:18] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:46:18] [INFO ] Time to serialize gal into /tmp/LTL10325284487689803621.gal : 5 ms
[2024-05-29 00:46:18] [INFO ] Time to serialize properties into /tmp/LTL9325105315114045643.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/LTL10325284487689803621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9325105315114045643.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(("(p2336==1)")||(F((G(F("(((p1777!=1)||(p1796!=1))||((p1810!=1)||(p115!=1)))")))||(("(((p302!=1)||(p321!=1))||(p335!=1))")&&(X(X(...220
Formula 0 simplified : F(!"(p2336==1)" & G(FG!"(((p1777!=1)||(p1796!=1))||((p1810!=1)||(p115!=1)))" & (!"(((p302!=1)||(p321!=1))||(p335!=1))" | XXG!"(((p17...204
Detected timeout of ITS tools.
[2024-05-29 00:46:33] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:46:33] [INFO ] Applying decomposition
[2024-05-29 00:46:33] [INFO ] Flatten gal took : 27 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/graph13286225768455341188.txt' '-o' '/tmp/graph13286225768455341188.bin' '-w' '/tmp/graph13286225768455341188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13286225768455341188.bin' '-l' '-1' '-v' '-w' '/tmp/graph13286225768455341188.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:46:33] [INFO ] Decomposing Gal with order
[2024-05-29 00:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:46:33] [INFO ] Removed a total of 643 redundant transitions.
[2024-05-29 00:46:33] [INFO ] Flatten gal took : 39 ms
[2024-05-29 00:46:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 610 labels/synchronizations in 7 ms.
[2024-05-29 00:46:33] [INFO ] Time to serialize gal into /tmp/LTL5459991134575833507.gal : 7 ms
[2024-05-29 00:46:33] [INFO ] Time to serialize properties into /tmp/LTL13152505704191518207.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/LTL5459991134575833507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13152505704191518207.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(("(i38.i2.u353.p2336==1)")||(F((G(F("(((i29.i0.u267.p1777!=1)||(i29.i0.u270.p1796!=1))||((i29.i2.u272.p1810!=1)||(i1.i0.u12.p115!...354
Formula 0 simplified : F(!"(i38.i2.u353.p2336==1)" & G(FG!"(((i29.i0.u267.p1777!=1)||(i29.i0.u270.p1796!=1))||((i29.i2.u272.p1810!=1)||(i1.i0.u12.p115!=1))...338
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10045099591284582845
[2024-05-29 00:46:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10045099591284582845
Running compilation step : cd /tmp/ltsmin10045099591284582845;'/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 1696 ms.
Running link step : cd /tmp/ltsmin10045099591284582845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10045099591284582845;'/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)&&X(X(<>((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-11 finished in 142590 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)))'
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)||F(G(p1))) U !p1))'
[2024-05-29 00:47:03] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3834923762715123081
[2024-05-29 00:47:04] [INFO ] Too many transitions (2092) to apply POR reductions. Disabling POR matrices.
[2024-05-29 00:47:04] [INFO ] Applying decomposition
[2024-05-29 00:47:04] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3834923762715123081
Running compilation step : cd /tmp/ltsmin3834923762715123081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '72' '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 00:47:04] [INFO ] Flatten gal took : 45 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/graph3337256189289215067.txt' '-o' '/tmp/graph3337256189289215067.bin' '-w' '/tmp/graph3337256189289215067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3337256189289215067.bin' '-l' '-1' '-v' '-w' '/tmp/graph3337256189289215067.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:47:04] [INFO ] Decomposing Gal with order
[2024-05-29 00:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:47:04] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-29 00:47:04] [INFO ] Flatten gal took : 74 ms
[2024-05-29 00:47:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 00:47:04] [INFO ] Time to serialize gal into /tmp/LTLFireability13537963544406321239.gal : 21 ms
[2024-05-29 00:47:04] [INFO ] Time to serialize properties into /tmp/LTLFireability11997162423460246529.ltl : 14 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/LTLFireability13537963544406321239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11997162423460246529.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 10 LTL properties
Checking formula 0 : !((F(G((!("(((i37.i3.u754.p2246==1)&&(i37.i2.u758.p2257==1))&&(i37.i6.u765.p2282==1))"))&&((!("(((i37.i3.u754.p2246==1)&&(i37.i2.u758....313
Formula 0 simplified : GF("(((i37.i3.u754.p2246==1)&&(i37.i2.u758.p2257==1))&&(i37.i6.u765.p2282==1))" | ("(((i37.i3.u754.p2246==1)&&(i37.i2.u758.p2257==1)...210
Compilation finished in 4374 ms.
Running link step : cd /tmp/ltsmin3834923762715123081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3834923762715123081;'/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)&&(!(LTLAPp0==true) U (X((LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin3834923762715123081;'/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)&&(!(LTLAPp0==true) U (X((LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3834923762715123081;'/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' '[](<>(((LTLAPp2==true)||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin3834923762715123081;'/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' '[](<>(((LTLAPp2==true)||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3834923762715123081;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin3834923762715123081;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3834923762715123081;'/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' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin3834923762715123081;'/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' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3834923762715123081;'/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(X(X(<>((LTLAPp6==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 01:15:06] [INFO ] Applying decomposition
[2024-05-29 01:15:07] [INFO ] Flatten gal took : 645 ms
[2024-05-29 01:15:07] [INFO ] Decomposing Gal with order
[2024-05-29 01:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:15:09] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-29 01:15:09] [INFO ] Flatten gal took : 628 ms
[2024-05-29 01:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 195 ms.
[2024-05-29 01:15:13] [INFO ] Time to serialize gal into /tmp/LTLFireability10237875612309505201.gal : 55 ms
[2024-05-29 01:15:13] [INFO ] Time to serialize properties into /tmp/LTLFireability17723269241440215837.ltl : 6 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/LTLFireability10237875612309505201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17723269241440215837.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 10 LTL properties
Checking formula 0 : !((F(G((!("(((i0.i0.i1.i0.i0.i0.i0.i0.u681.p2246==1)&&(i0.i0.i1.i0.i0.i0.u683.p2257==1))&&(i0.i0.i1.u686.p2282==1))"))&&((!("(((i0.i0....514
Formula 0 simplified : GF("(((i0.i0.i1.i0.i0.i0.i0.i0.u681.p2246==1)&&(i0.i0.i1.i0.i0.i0.u683.p2257==1))&&(i0.i0.i1.u686.p2282==1))" | ("(((i0.i0.i1.i0.i0....381
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin3834923762715123081;'/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(X(X(<>((LTLAPp6==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3834923762715123081;'/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' '[](<>(([]((LTLAPp8==true))||(LTLAPp7==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9283004 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15273120 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-040B"
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-040B, 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-171683788500088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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