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.r197-tall-171640625200252.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 GPPP-PT-C0100N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C0100N0000000010-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716544261906

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 09:51:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 09:51:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:51:03] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2024-05-24 09:51:03] [INFO ] Transformed 33 places.
[2024-05-24 09:51:03] [INFO ] Transformed 22 transitions.
[2024-05-24 09:51:03] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:51:03] [INFO ] Computed 12 invariants in 14 ms
[2024-05-24 09:51:03] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
[2024-05-24 09:51:03] [INFO ] Invariant cache hit.
[2024-05-24 09:51:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 09:51:03] [INFO ] Invariant cache hit.
[2024-05-24 09:51:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 09:51:03] [INFO ] Invariant cache hit.
[2024-05-24 09:51:03] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 29 out of 33 places after structural reductions.
[2024-05-24 09:51:04] [INFO ] Flatten gal took : 16 ms
[2024-05-24 09:51:04] [INFO ] Flatten gal took : 6 ms
[2024-05-24 09:51:04] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10003 steps, including 23 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 09:51:04] [INFO ] Invariant cache hit.
[2024-05-24 09:51:04] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 09:51:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:51:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
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-24 09:51:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 09:51:29] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Applied a total of 7 rules in 10 ms. Remains 29 /33 variables (removed 4) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 29 cols
[2024-05-24 09:51:29] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 09:51:29] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 29/33 places, 19/22 transitions.
Incomplete random walk after 10006 steps, including 33 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) 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 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 10000 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 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1051384 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1051384 steps, saw 172027 distinct states, run finished after 3002 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 09:51:33] [INFO ] Invariant cache hit.
[2024-05-24 09:51:33] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 09:51:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:51:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 651 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
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-24 09:51:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 09:51:58] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 19/19 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 29/29 places, 19/19 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2024-05-24 09:51:58] [INFO ] Invariant cache hit.
[2024-05-24 09:51:58] [INFO ] Implicit Places using invariants in 55 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/29 places, 19/19 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 24 transition count 16
Applied a total of 6 rules in 3 ms. Remains 24 /27 variables (removed 3) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-24 09:51:58] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 09:51:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 09:51:58] [INFO ] Invariant cache hit.
[2024-05-24 09:51:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 24/29 places, 16/19 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 147 ms. Remains : 24/29 places, 16/19 transitions.
Incomplete random walk after 10001 steps, including 37 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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
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 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 974867 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 974867 steps, saw 170661 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 09:52:01] [INFO ] Invariant cache hit.
[2024-05-24 09:52:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 09:52:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 09:52:01] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 09:52:25] [INFO ] After 24244ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 21 transition count 14
Applied a total of 5 rules in 6 ms. Remains 21 /24 variables (removed 3) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 21/24 places, 14/16 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1761768 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :{}
Probabilistic random walk after 1761768 steps, saw 294845 distinct states, run finished after 3001 ms. (steps per millisecond=587 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14 rows 21 cols
[2024-05-24 09:52:29] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 09:52:29] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:52:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 09:52:29] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:52:47] [INFO ] After 18043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 21/21 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-24 09:52:47] [INFO ] Invariant cache hit.
[2024-05-24 09:52:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 09:52:47] [INFO ] Invariant cache hit.
[2024-05-24 09:52:47] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [0, 2, 14]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 192 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 18/21 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 195 ms. Remains : 18/21 places, 14/14 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 16
Applied a total of 12 rules in 9 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-24 09:52:47] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 09:52:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 09:52:47] [INFO ] Invariant cache hit.
[2024-05-24 09:52:47] [INFO ] Implicit Places using invariants in 31 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 16/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 13
Applied a total of 7 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 20 cols
[2024-05-24 09:52:47] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 09:52:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 09:52:47] [INFO ] Invariant cache hit.
[2024-05-24 09:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:52:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 13/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 168 ms. Remains : 18/33 places, 13/22 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 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-01 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:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-01 finished in 395 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)||G(p2)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 27 transition count 17
Applied a total of 10 rules in 10 ms. Remains 27 /33 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2024-05-24 09:52:48] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 09:52:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-24 09:52:48] [INFO ] Invariant cache hit.
[2024-05-24 09:52:48] [INFO ] Implicit Places using invariants in 35 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 16
Applied a total of 2 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-24 09:52:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:52:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 09:52:48] [INFO ] Invariant cache hit.
[2024-05-24 09:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:52:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [0, 2, 17]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 100 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 16/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 189 ms. Remains : 21/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(GT s12 s9), p0:(GT s3 s2), p2:(GT 2 s14)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 5 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-04 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U (p1 U p2)) U (G(!p3)||G(!p1))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:52:48] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 09:52:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2024-05-24 09:52:48] [INFO ] Invariant cache hit.
[2024-05-24 09:52:48] [INFO ] Implicit Places using invariants in 32 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 695 ms :[(AND p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p0), p3, p1, (AND p3 p1), (AND (NOT p0) p3), (NOT p2), (AND p0 (NOT p2) p3)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p3 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p3 p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p1) p2 p0), acceptance={} source=1 dest: 4}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=1 dest: 8}, { cond=(AND p3 p1 p0), acceptance={} source=1 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=1 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 11}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 12}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=1 dest: 13}], [{ cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 14}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 15}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 13}], [{ cond=(OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p1) p2 p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p1 p0), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 14}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=p3, acceptance={} source=10 dest: 8}, { cond=(NOT p3), acceptance={} source=10 dest: 10}], [{ cond=p1, acceptance={} source=11 dest: 8}, { cond=(NOT p1), acceptance={} source=11 dest: 11}], [{ cond=(AND p3 p1), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p3) p1), acceptance={} source=12 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=12 dest: 12}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=13 dest: 8}, { cond=(AND p3 p0), acceptance={} source=13 dest: 9}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p3) p0), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=14 dest: 14}], [{ cond=(AND p3 (NOT p1) (NOT p2) p0), acceptance={} source=15 dest: 8}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=15 dest: 10}, { cond=(AND p3 p1 (NOT p2) p0), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=15 dest: 15}]], initial=0, aps=[p3:(LEQ 3 s15), p1:(LEQ 3 s3), p2:(LEQ s1 s6), p0:(GT s31 s10)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 122 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-05 finished in 815 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)&&X(p1)))||X((G(p2) U p0))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:52:49] [INFO ] Invariant cache hit.
[2024-05-24 09:52:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-24 09:52:49] [INFO ] Invariant cache hit.
[2024-05-24 09:52:49] [INFO ] Implicit Places using invariants in 36 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s23 s20), p1:(GT 1 s17), p2:(LEQ s26 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 22 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-06 finished in 701 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 (G(p0)||(p0&&G(p1))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:52:49] [INFO ] Invariant cache hit.
[2024-05-24 09:52:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-24 09:52:49] [INFO ] Invariant cache hit.
[2024-05-24 09:52:49] [INFO ] Implicit Places using invariants in 39 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s8 s29), p1:(GT s18 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-07 finished in 264 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((p1&&F(p2)))&&p0)))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 18
Applied a total of 9 rules in 6 ms. Remains 28 /33 variables (removed 5) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 28 cols
[2024-05-24 09:52:50] [INFO ] Computed 11 invariants in 0 ms
[2024-05-24 09:52:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:52:50] [INFO ] Invariant cache hit.
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants in 41 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/33 places, 18/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 26/33 places, 18/22 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GT s11 s18) (GT s14 s21)), p1:(LEQ s4 s1), p2:(LEQ s8 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 324 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-08 finished in 244 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(p0))&&F(p1)))||(F(!p2)&&F((p1&&F(G(p0)))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 7 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-24 09:52:50] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:52:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 09:52:50] [INFO ] Invariant cache hit.
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants in 38 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 16/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 13
Applied a total of 7 rules in 2 ms. Remains 19 /23 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-24 09:52:50] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 09:52:50] [INFO ] Invariant cache hit.
[2024-05-24 09:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 19/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 1 s10), p2:(AND (LEQ 1 s3) (LEQ 1 s0)), p0:(GT 1 s0)], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-09 finished in 391 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 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
Applied a total of 7 rules in 7 ms. Remains 29 /33 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 29 cols
[2024-05-24 09:52:50] [INFO ] Computed 12 invariants in 0 ms
[2024-05-24 09:52:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:52:50] [INFO ] Invariant cache hit.
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants in 31 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/33 places, 18/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 23 transition count 15
Applied a total of 7 rules in 2 ms. Remains 23 /27 variables (removed 4) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-24 09:52:50] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 09:52:50] [INFO ] Invariant cache hit.
[2024-05-24 09:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:52:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 23/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 s16) (GT s10 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-10 finished in 183 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' '!(((p0 U p1)||G((p2&&X((p3&&X(p3)))))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:52:50] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 09:52:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-24 09:52:50] [INFO ] Invariant cache hit.
[2024-05-24 09:52:51] [INFO ] Implicit Places using invariants in 27 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s1 s0), p0:(LEQ s10 s14), p2:(LEQ s18 s19), p3:(LEQ s18 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND (NOT p1) p0 p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p1) (NOT p0) p2 p3))), true, (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 112 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-11 finished in 618 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(G(p0))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:52:51] [INFO ] Invariant cache hit.
[2024-05-24 09:52:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 09:52:51] [INFO ] Invariant cache hit.
[2024-05-24 09:52:51] [INFO ] Implicit Places using invariants in 28 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ 1 s0) (LEQ 2 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 233 reset in 126 ms.
Product exploration explored 100000 steps with 233 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 09:52:52] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 09:52:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:52:52] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:52:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 09:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:52:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:52:52] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 09:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:52:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:52:52] [INFO ] Computed and/alt/rep : 21/48/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:52:52] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:52:52] [INFO ] Invariant cache hit.
[2024-05-24 09:52:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-24 09:52:52] [INFO ] Invariant cache hit.
[2024-05-24 09:52:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 09:52:52] [INFO ] Invariant cache hit.
[2024-05-24 09:52:52] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 31/32 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:52:53] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 09:52:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:52:53] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:52:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-24 09:52:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:52:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:52:53] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:52:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 09:52:53] [INFO ] Computed and/alt/rep : 21/48/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:52:53] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 232 reset in 120 ms.
Product exploration explored 100000 steps with 233 reset in 128 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 5 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 29 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 29 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 29 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 9 ms. Remains 29 /31 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 29 cols
[2024-05-24 09:52:54] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:52:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 09:52:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:52:54] [INFO ] Invariant cache hit.
[2024-05-24 09:52:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/31 places, 20/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 29/31 places, 20/22 transitions.
Built C files in :
/tmp/ltsmin2451446554720076481
[2024-05-24 09:52:54] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2451446554720076481
Running compilation step : cd /tmp/ltsmin2451446554720076481;'/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 179 ms.
Running link step : cd /tmp/ltsmin2451446554720076481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2451446554720076481;'/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/stateBased8843397579012092298.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:53:09] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:53:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 09:53:09] [INFO ] Invariant cache hit.
[2024-05-24 09:53:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 09:53:09] [INFO ] Invariant cache hit.
[2024-05-24 09:53:09] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 09:53:09] [INFO ] Invariant cache hit.
[2024-05-24 09:53:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 31/31 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin14230137977317417340
[2024-05-24 09:53:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14230137977317417340
Running compilation step : cd /tmp/ltsmin14230137977317417340;'/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 94 ms.
Running link step : cd /tmp/ltsmin14230137977317417340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14230137977317417340;'/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/stateBased14510073162977117603.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 09:53:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:53:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:53:24] [INFO ] Time to serialize gal into /tmp/LTL10056575365460696884.gal : 1 ms
[2024-05-24 09:53:24] [INFO ] Time to serialize properties into /tmp/LTL11776215964258677488.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/LTL10056575365460696884.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14877685691718109588.hoa' '-atoms' '/tmp/LTL11776215964258677488.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/LTL11776215964258677488.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14877685691718109588.hoa
Detected timeout of ITS tools.
[2024-05-24 09:53:39] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:53:39] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:53:39] [INFO ] Time to serialize gal into /tmp/LTL17900154890096998719.gal : 1 ms
[2024-05-24 09:53:39] [INFO ] Time to serialize properties into /tmp/LTL9997544186332229649.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/LTL17900154890096998719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9997544186332229649.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 : !((X(X(G("((Pi>=1)&&(ADP>=2))")))))
Formula 0 simplified : XXF!"((Pi>=1)&&(ADP>=2))"
Detected timeout of ITS tools.
[2024-05-24 09:53:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:53:54] [INFO ] Applying decomposition
[2024-05-24 09:53:54] [INFO ] Flatten gal took : 4 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/graph13628522547229086724.txt' '-o' '/tmp/graph13628522547229086724.bin' '-w' '/tmp/graph13628522547229086724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13628522547229086724.bin' '-l' '-1' '-v' '-w' '/tmp/graph13628522547229086724.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:53:54] [INFO ] Decomposing Gal with order
[2024-05-24 09:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:53:54] [INFO ] Flatten gal took : 23 ms
[2024-05-24 09:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 09:53:54] [INFO ] Time to serialize gal into /tmp/LTL8038776442690718348.gal : 1 ms
[2024-05-24 09:53:54] [INFO ] Time to serialize properties into /tmp/LTL5434902916645349406.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/LTL8038776442690718348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5434902916645349406.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i3.u3.Pi>=1)&&(i3.u3.ADP>=2))")))))
Formula 0 simplified : XXF!"((i3.u3.Pi>=1)&&(i3.u3.ADP>=2))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14590025474842563499
[2024-05-24 09:54:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14590025474842563499
Running compilation step : cd /tmp/ltsmin14590025474842563499;'/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 95 ms.
Running link step : cd /tmp/ltsmin14590025474842563499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14590025474842563499;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-13 finished in 93448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 12 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-24 09:54:25] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 09:54:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-24 09:54:25] [INFO ] Invariant cache hit.
[2024-05-24 09:54:25] [INFO ] Implicit Places using invariants in 33 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 15/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 13
Applied a total of 4 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 20 cols
[2024-05-24 09:54:25] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 09:54:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 09:54:25] [INFO ] Invariant cache hit.
[2024-05-24 09:54:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:54:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [0, 2, 13]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 13/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 159 ms. Remains : 17/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-14 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||((p1 U !p2)&&X(X(G(!p2))))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:54:25] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 09:54:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-24 09:54:25] [INFO ] Invariant cache hit.
[2024-05-24 09:54:25] [INFO ] Implicit Places using invariants in 32 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), p2]
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR p0 (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(GT 1 s0), p1:(LEQ 2 s29), p0:(LEQ 2 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 233 reset in 117 ms.
Product exploration explored 100000 steps with 233 reset in 120 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, p2, p2, p2]
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 : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 13 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 101 ms :[true, p2, p2, p2]
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:54:26] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:54:26] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 09:54:26] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:54:26] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 09:54:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:54:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:54:26] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:54:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 09:54:26] [INFO ] Computed and/alt/rep : 21/42/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:54:26] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p2
Support contains 1 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:54:26] [INFO ] Invariant cache hit.
[2024-05-24 09:54:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:54:26] [INFO ] Invariant cache hit.
[2024-05-24 09:54:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 09:54:26] [INFO ] Invariant cache hit.
[2024-05-24 09:54:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 30/31 places, 22/22 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 : [p2, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p2, p2, p2]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 104 ms :[true, p2, p2, p2]
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 09:54:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:54:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:54:27] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:54:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-24 09:54:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:54:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:54:27] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 09:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:54:27] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-24 09:54:27] [INFO ] Computed and/alt/rep : 21/42/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:54:27] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 117 ms :[true, p2, p2, p2]
Product exploration explored 100000 steps with 233 reset in 115 ms.
Product exploration explored 100000 steps with 233 reset in 122 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 111 ms :[true, p2, p2, p2]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 29 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 28 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 28 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 27 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 27 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 12 rules in 9 ms. Remains 27 /30 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 27 cols
[2024-05-24 09:54:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:54:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-24 09:54:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:54:27] [INFO ] Invariant cache hit.
[2024-05-24 09:54:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/30 places, 19/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 27/30 places, 19/22 transitions.
Built C files in :
/tmp/ltsmin292381592997479562
[2024-05-24 09:54:27] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin292381592997479562
Running compilation step : cd /tmp/ltsmin292381592997479562;'/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 108 ms.
Running link step : cd /tmp/ltsmin292381592997479562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin292381592997479562;'/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/stateBased8010662483813357833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 09:54:43] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:54:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-24 09:54:43] [INFO ] Invariant cache hit.
[2024-05-24 09:54:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 09:54:43] [INFO ] Invariant cache hit.
[2024-05-24 09:54:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-24 09:54:43] [INFO ] Invariant cache hit.
[2024-05-24 09:54:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 30/30 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin6409794979467035875
[2024-05-24 09:54:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6409794979467035875
Running compilation step : cd /tmp/ltsmin6409794979467035875;'/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 99 ms.
Running link step : cd /tmp/ltsmin6409794979467035875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6409794979467035875;'/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/stateBased13074676086120559674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 09:54:58] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:54:58] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:54:58] [INFO ] Time to serialize gal into /tmp/LTL357588893724567279.gal : 1 ms
[2024-05-24 09:54:58] [INFO ] Time to serialize properties into /tmp/LTL3524321382086716456.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/LTL357588893724567279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12352680987591271466.hoa' '-atoms' '/tmp/LTL3524321382086716456.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/LTL3524321382086716456.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12352680987591271466.hoa
Detected timeout of ITS tools.
[2024-05-24 09:55:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:55:13] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:55:13] [INFO ] Time to serialize gal into /tmp/LTL17319802851817422478.gal : 0 ms
[2024-05-24 09:55:13] [INFO ] Time to serialize properties into /tmp/LTL561754886719047765.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17319802851817422478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL561754886719047765.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(a2>=2)")||((("(c1>=2)")U("(Pi>=1)"))&&(X(X(G("(Pi>=1)")))))))))
Formula 0 simplified : XF(!"(a2>=2)" & ((!"(c1>=2)" R !"(Pi>=1)") | XXF!"(Pi>=1)"))
Detected timeout of ITS tools.
[2024-05-24 09:55:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 09:55:28] [INFO ] Applying decomposition
[2024-05-24 09:55:28] [INFO ] Flatten gal took : 1 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/graph10539794004630627478.txt' '-o' '/tmp/graph10539794004630627478.bin' '-w' '/tmp/graph10539794004630627478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10539794004630627478.bin' '-l' '-1' '-v' '-w' '/tmp/graph10539794004630627478.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:55:28] [INFO ] Decomposing Gal with order
[2024-05-24 09:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:55:28] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-24 09:55:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 09:55:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 09:55:28] [INFO ] Time to serialize gal into /tmp/LTL2281929240331566070.gal : 1 ms
[2024-05-24 09:55:28] [INFO ] Time to serialize properties into /tmp/LTL4750737486770291489.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/LTL2281929240331566070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4750737486770291489.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(u7.a2>=2)")||((("(i2.u8.c1>=2)")U("(u0.Pi>=1)"))&&(X(X(G("(u0.Pi>=1)")))))))))
Formula 0 simplified : XF(!"(u7.a2>=2)" & ((!"(i2.u8.c1>=2)" R !"(u0.Pi>=1)") | XXF!"(u0.Pi>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t13, i1.u2.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
Computing Next relation with stutter on 4 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11922288298463394034
[2024-05-24 09:55:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11922288298463394034
Running compilation step : cd /tmp/ltsmin11922288298463394034;'/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 94 ms.
Running link step : cd /tmp/ltsmin11922288298463394034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11922288298463394034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||(((LTLAPp1==true) U !(LTLAPp2==true))&&X(X([](!(LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-15 finished in 93347 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(G(p0))))'
Found a Lengthening insensitive property : GPPP-PT-C0100N0000000010-LTLCardinality-13
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 10 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-24 09:55:58] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:55:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-24 09:55:58] [INFO ] Invariant cache hit.
[2024-05-24 09:55:58] [INFO ] Implicit Places using invariants in 35 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/33 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 15
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-24 09:55:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:55:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 09:55:58] [INFO ] Invariant cache hit.
[2024-05-24 09:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:55:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 77 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 22/33 places, 15/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 155 ms. Remains : 22/33 places, 15/22 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ 1 s0) (LEQ 2 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 516 reset in 108 ms.
Product exploration explored 100000 steps with 516 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 15 rows 22 cols
[2024-05-24 09:55:59] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 09:55:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:55:59] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:55:59] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 09:55:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:55:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:55:59] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:55:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:55:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:55:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 09:55:59] [INFO ] Computed and/alt/rep : 14/37/14 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:55:59] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-24 09:55:59] [INFO ] Invariant cache hit.
[2024-05-24 09:55:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-24 09:55:59] [INFO ] Invariant cache hit.
[2024-05-24 09:55:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 09:55:59] [INFO ] Invariant cache hit.
[2024-05-24 09:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:56:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 09:56:00] [INFO ] Invariant cache hit.
[2024-05-24 09:56:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 22/22 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 09:56:00] [INFO ] Invariant cache hit.
[2024-05-24 09:56:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:56:00] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:56:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 09:56:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:56:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:56:00] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:56:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 09:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:56:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 09:56:00] [INFO ] Computed and/alt/rep : 14/37/14 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 09:56:00] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 517 reset in 106 ms.
Product exploration explored 100000 steps with 516 reset in 132 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-24 09:56:01] [INFO ] Invariant cache hit.
[2024-05-24 09:56:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 09:56:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:56:01] [INFO ] Invariant cache hit.
[2024-05-24 09:56:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 22/22 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin14864936853000264811
[2024-05-24 09:56:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14864936853000264811
Running compilation step : cd /tmp/ltsmin14864936853000264811;'/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 84 ms.
Running link step : cd /tmp/ltsmin14864936853000264811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14864936853000264811;'/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/stateBased13192134233539626267.hoa' '--buchi-type=spotba'
LTSmin run took 5082 ms.
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-13 finished in 7968 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||((p1 U !p2)&&X(X(G(!p2))))))))'
Found a Lengthening insensitive property : GPPP-PT-C0100N0000000010-LTLCardinality-15
Stuttering acceptance computed with spot in 195 ms :[true, (AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), p2]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 5 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-24 09:56:06] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:56:06] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:56:06] [INFO ] Invariant cache hit.
[2024-05-24 09:56:06] [INFO ] Implicit Places using invariants in 31 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 23/33 places, 16/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 13
Applied a total of 7 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-24 09:56:06] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 09:56:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 09:56:06] [INFO ] Invariant cache hit.
[2024-05-24 09:56:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:56:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 19/33 places, 13/22 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 153 ms. Remains : 19/33 places, 13/22 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000000010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR p0 (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(GT 1 s0), p1:(LEQ 2 s17), p0:(LEQ 2 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 558 reset in 83 ms.
Product exploration explored 100000 steps with 557 reset in 100 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p2, p2, p2]
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 : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 124 ms :[true, p2, p2, p2]
[2024-05-24 09:56:07] [INFO ] Invariant cache hit.
[2024-05-24 09:56:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 09:56:07] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:56:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 09:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:56:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 09:56:07] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:56:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 09:56:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:56:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 09:56:07] [INFO ] Computed and/alt/rep : 12/28/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:56:07] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p2
Support contains 1 out of 19 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-24 09:56:07] [INFO ] Invariant cache hit.
[2024-05-24 09:56:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-24 09:56:07] [INFO ] Invariant cache hit.
[2024-05-24 09:56:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 09:56:07] [INFO ] Invariant cache hit.
[2024-05-24 09:56:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:56:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-24 09:56:08] [INFO ] Invariant cache hit.
[2024-05-24 09:56:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 19/19 places, 13/13 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 : [p2, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p2, p2, p2]
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 : [p2, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 113 ms :[true, p2, p2, p2]
[2024-05-24 09:56:08] [INFO ] Invariant cache hit.
[2024-05-24 09:56:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:56:08] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:56:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 09:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:56:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:56:08] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:56:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 09:56:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:56:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 09:56:08] [INFO ] Computed and/alt/rep : 12/28/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:56:08] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 114 ms :[true, p2, p2, p2]
Product exploration explored 100000 steps with 557 reset in 88 ms.
Product exploration explored 100000 steps with 556 reset in 90 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[true, p2, p2, p2]
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-24 09:56:09] [INFO ] Invariant cache hit.
[2024-05-24 09:56:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-24 09:56:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:56:09] [INFO ] Invariant cache hit.
[2024-05-24 09:56:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 19/19 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin10118852008224402124
[2024-05-24 09:56:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10118852008224402124
Running compilation step : cd /tmp/ltsmin10118852008224402124;'/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 95 ms.
Running link step : cd /tmp/ltsmin10118852008224402124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10118852008224402124;'/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/stateBased4419684737376395104.hoa' '--buchi-type=spotba'
LTSmin run took 2116 ms.
Treatment of property GPPP-PT-C0100N0000000010-LTLCardinality-15 finished in 4957 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-24 09:56:11] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin447935667086771606
[2024-05-24 09:56:11] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-24 09:56:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:56:11] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-24 09:56:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:56:11] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-24 09:56:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:56:11] [INFO ] Applying decomposition
[2024-05-24 09:56:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin447935667086771606
Running compilation step : cd /tmp/ltsmin447935667086771606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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-24 09:56:11] [INFO ] Flatten gal took : 2 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/graph14930411852603005786.txt' '-o' '/tmp/graph14930411852603005786.bin' '-w' '/tmp/graph14930411852603005786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14930411852603005786.bin' '-l' '-1' '-v' '-w' '/tmp/graph14930411852603005786.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:56:11] [INFO ] Decomposing Gal with order
[2024-05-24 09:56:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:56:11] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-24 09:56:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 09:56:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 09:56:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality5715128974421179513.gal : 1 ms
[2024-05-24 09:56:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality16841641541775125488.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/LTLCardinality5715128974421179513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16841641541775125488.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...277
Read 2 LTL properties
Checking formula 0 : !((X(X(G("((i2.u4.Pi>=1)&&(i2.u4.ADP>=2))")))))
Formula 0 simplified : XXF!"((i2.u4.Pi>=1)&&(i2.u4.ADP>=2))"
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin447935667086771606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin447935667086771606;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t13, i1.u2.t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
Computing Next relation with stutter on 4 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: X(X([]((LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: "X(X([]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.101: DFS-FIFO for weak LTL, using special progress label 27
pins2lts-mc-linux64( 0/ 8), 0.101: There are 28 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.101: State length is 34, there are 27 groups
pins2lts-mc-linux64( 0/ 8), 0.101: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.101: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.101: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.101: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.116: ~1 levels ~960 states ~3840 transitions
pins2lts-mc-linux64( 2/ 8), 0.124: ~1 levels ~1920 states ~8304 transitions
pins2lts-mc-linux64( 2/ 8), 0.153: ~1 levels ~3840 states ~17912 transitions
pins2lts-mc-linux64( 2/ 8), 0.188: ~1 levels ~7680 states ~38584 transitions
pins2lts-mc-linux64( 2/ 8), 0.266: ~1 levels ~15360 states ~82848 transitions
pins2lts-mc-linux64( 2/ 8), 0.428: ~1 levels ~30720 states ~173184 transitions
pins2lts-mc-linux64( 2/ 8), 0.721: ~1 levels ~61440 states ~364832 transitions
pins2lts-mc-linux64( 7/ 8), 1.165: ~1 levels ~122880 states ~832976 transitions
pins2lts-mc-linux64( 2/ 8), 1.826: ~1 levels ~245760 states ~1596856 transitions
pins2lts-mc-linux64( 2/ 8), 2.702: ~1 levels ~491520 states ~3322608 transitions
pins2lts-mc-linux64( 7/ 8), 3.687: ~1 levels ~983040 states ~7487624 transitions
pins2lts-mc-linux64( 2/ 8), 5.662: ~1 levels ~1966080 states ~14043480 transitions
pins2lts-mc-linux64( 5/ 8), 9.342: ~1 levels ~3932160 states ~31150816 transitions
pins2lts-mc-linux64( 5/ 8), 17.239: ~1 levels ~7864320 states ~63069176 transitions
pins2lts-mc-linux64( 4/ 8), 32.544: ~1 levels ~15728640 states ~124496296 transitions
pins2lts-mc-linux64( 4/ 8), 64.461: ~1 levels ~31457280 states ~251902920 transitions
pins2lts-mc-linux64( 4/ 8), 131.783: ~1 levels ~62914560 states ~511721488 transitions
pins2lts-mc-linux64( 7/ 8), 289.167: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 289.191:
pins2lts-mc-linux64( 0/ 8), 289.191: mean standard work distribution: 2.6% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 289.191:
pins2lts-mc-linux64( 0/ 8), 289.191: Explored 116978741 states 999028653 transitions, fanout: 8.540
pins2lts-mc-linux64( 0/ 8), 289.191: Total exploration time 289.070 sec (289.030 sec minimum, 289.054 sec on average)
pins2lts-mc-linux64( 0/ 8), 289.191: States per second: 404673, Transitions per second: 3456010
pins2lts-mc-linux64( 0/ 8), 289.191:
pins2lts-mc-linux64( 0/ 8), 289.191: Progress states detected: 134216584
pins2lts-mc-linux64( 0/ 8), 289.191: Redundant explorations: -12.8434
pins2lts-mc-linux64( 0/ 8), 289.191:
pins2lts-mc-linux64( 0/ 8), 289.191: Queue width: 8B, total height: 34740637, memory: 265.05MB
pins2lts-mc-linux64( 0/ 8), 289.191: Tree memory: 1109.5MB, 8.7 B/state, compr.: 6.3%
pins2lts-mc-linux64( 0/ 8), 289.191: Tree fill ratio (roots/leafs): 99.0%/33.0%
pins2lts-mc-linux64( 0/ 8), 289.191: Stored 23 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 289.191: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 289.191: Est. total memory use: 1374.5MB (~1289.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin447935667086771606;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin447935667086771606;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 10:17:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 10:17:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality5011717085260703847.gal : 0 ms
[2024-05-24 10:17:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality18128962694317656343.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/LTLCardinality5011717085260703847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18128962694317656343.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...298
Read 2 LTL properties
Checking formula 0 : !((X(X(G("((Pi>=1)&&(ADP>=2))")))))
Formula 0 simplified : XXF!"((Pi>=1)&&(ADP>=2))"
Detected timeout of ITS tools.
[2024-05-24 10:39:41] [INFO ] Flatten gal took : 161 ms
[2024-05-24 10:39:42] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-24 10:39:42] [INFO ] Transformed 33 places.
[2024-05-24 10:39:42] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 10:39:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality14802639845299475949.gal : 16 ms
[2024-05-24 10:39:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality18416344994020311358.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/LTLCardinality14802639845299475949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18416344994020311358.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G("((Pi>=1)&&(ADP>=2))")))))
Formula 0 simplified : XXF!"((Pi>=1)&&(ADP>=2))"
Reverse transition relation is NOT exact ! Due to transitions t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
Computing Next relation with stutter on 4 deadlock states
278 unique states visited
0 strongly connected components in search stack
278 transitions explored
278 items max in DFS search stack
23640 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,236.435,2489048,1,0,595,1.42528e+07,15,1242,1100,1.55429e+07,2978
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G(("(a2>=2)")||((("(c1>=2)")U("(Pi>=1)"))&&(X(X(G("(Pi>=1)")))))))))
Formula 1 simplified : XF(!"(a2>=2)" & ((!"(c1>=2)" R !"(Pi>=1)") | XXF!"(Pi>=1)"))
Computing Next relation with stutter on 4 deadlock states
278 unique states visited
0 strongly connected components in search stack
278 transitions explored
278 items max in DFS search stack
19761 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,434.06,3050636,1,0,822,1.77708e+07,23,1470,1109,1.94705e+07,2695
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 3358018 ms.

BK_STOP 1716547623102

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="GPPP-PT-C0100N0000000010"
export BK_EXAMINATION="LTLCardinality"
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 GPPP-PT-C0100N0000000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625200252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;