Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873946000883.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873946000883
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K Mar 5 18:23 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 QuasiCertifProtocol-PT-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678993011127

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 18:56:52] [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]
[2023-03-16 18:56:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:56:53] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2023-03-16 18:56:53] [INFO ] Transformed 1398 places.
[2023-03-16 18:56:53] [INFO ] Transformed 296 transitions.
[2023-03-16 18:56:53] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 856 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1379 transition count 296
Applied a total of 19 rules in 55 ms. Remains 1379 /1398 variables (removed 19) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1379 cols
[2023-03-16 18:56:53] [INFO ] Computed 1084 place invariants in 77 ms
[2023-03-16 18:56:54] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2023-03-16 18:56:54] [INFO ] Invariant cache hit.
[2023-03-16 18:56:57] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned [835, 837, 838, 839, 840, 841, 842, 843, 844, 948, 949, 950, 951, 952, 953, 954, 955, 956]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 3532 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1361/1398 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 1361 /1361 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3604 ms. Remains : 1361/1398 places, 296/296 transitions.
Support contains 856 out of 1361 places after structural reductions.
[2023-03-16 18:56:57] [INFO ] Flatten gal took : 104 ms
[2023-03-16 18:56:57] [INFO ] Flatten gal took : 70 ms
[2023-03-16 18:56:57] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 837 out of 1361 places (down from 856) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 443 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 296 rows 1361 cols
[2023-03-16 18:56:58] [INFO ] Computed 1066 place invariants in 29 ms
[2023-03-16 18:56:59] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-16 18:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 18:56:59] [INFO ] [Nat]Absence check using 3 positive and 1063 generalized place invariants in 193 ms returned sat
[2023-03-16 18:57:15] [INFO ] After 15545ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :15
[2023-03-16 18:57:24] [INFO ] Deduced a trap composed of 6 places in 873 ms of which 11 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:57:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:57:24] [INFO ] After 25902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 15 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Parikh walk visited 15 properties in 47 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1361 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1361 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Support contains 400 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1358 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1357 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1356 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1356 transition count 294
Applied a total of 5 rules in 195 ms. Remains 1356 /1361 variables (removed 5) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1356 cols
[2023-03-16 18:57:25] [INFO ] Computed 1063 place invariants in 10 ms
[2023-03-16 18:57:26] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2023-03-16 18:57:26] [INFO ] Invariant cache hit.
[2023-03-16 18:57:28] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned [832, 1176, 1177, 1178, 1179, 1180, 1181, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1316, 1317, 1318, 1319, 1322]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2771 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1361 places, 294/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3011 ms. Remains : 1336/1361 places, 294/296 transitions.
Stuttering acceptance computed with spot in 674 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s75 s76 s77 s78 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s93 s95 s96 s97 s98)) (LEQ 1 s128)), p2:(AND (GT 1 s128) (GT (ADD s138 s139 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6240 reset in 2698 ms.
Product exploration explored 100000 steps with 6318 reset in 2658 ms.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 419 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 1336 cols
[2023-03-16 18:57:35] [INFO ] Computed 1044 place invariants in 24 ms
[2023-03-16 18:57:35] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 18:57:35] [INFO ] Invariant cache hit.
[2023-03-16 18:57:37] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1056 ms returned sat
[2023-03-16 18:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:57:41] [INFO ] [Real]Absence check using state equation in 3631 ms returned sat
[2023-03-16 18:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 18:57:42] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1091 ms returned sat
[2023-03-16 18:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 18:57:54] [INFO ] [Nat]Absence check using state equation in 11836 ms returned sat
[2023-03-16 18:57:54] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 22 ms.
[2023-03-16 18:57:55] [INFO ] Added : 57 causal constraints over 12 iterations in 829 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 42 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-16 18:57:55] [INFO ] Invariant cache hit.
[2023-03-16 18:57:56] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-16 18:57:56] [INFO ] Invariant cache hit.
[2023-03-16 18:57:58] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2565 ms to find 0 implicit places.
[2023-03-16 18:57:58] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-16 18:57:58] [INFO ] Invariant cache hit.
[2023-03-16 18:57:58] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3069 ms. Remains : 1336/1336 places, 294/294 transitions.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-16 18:57:59] [INFO ] Invariant cache hit.
[2023-03-16 18:58:01] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1110 ms returned sat
[2023-03-16 18:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:58:04] [INFO ] [Real]Absence check using state equation in 3761 ms returned sat
[2023-03-16 18:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 18:58:06] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1055 ms returned sat
[2023-03-16 18:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 18:58:17] [INFO ] [Nat]Absence check using state equation in 11460 ms returned sat
[2023-03-16 18:58:17] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 23 ms.
[2023-03-16 18:58:18] [INFO ] Added : 57 causal constraints over 12 iterations in 819 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6237 reset in 897 ms.
Product exploration explored 100000 steps with 6319 reset in 912 ms.
Built C files in :
/tmp/ltsmin3616631150407750561
[2023-03-16 18:58:20] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2023-03-16 18:58:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:58:20] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2023-03-16 18:58:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:58:20] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2023-03-16 18:58:20] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:58:20] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3616631150407750561
Running compilation step : cd /tmp/ltsmin3616631150407750561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1394 ms.
Running link step : cd /tmp/ltsmin3616631150407750561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3616631150407750561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4120585327548645726.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 43 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-16 18:58:35] [INFO ] Invariant cache hit.
[2023-03-16 18:58:36] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-16 18:58:36] [INFO ] Invariant cache hit.
[2023-03-16 18:58:38] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
[2023-03-16 18:58:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 18:58:38] [INFO ] Invariant cache hit.
[2023-03-16 18:58:38] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2907 ms. Remains : 1336/1336 places, 294/294 transitions.
Built C files in :
/tmp/ltsmin6404009582282213826
[2023-03-16 18:58:38] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2023-03-16 18:58:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:58:38] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2023-03-16 18:58:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:58:38] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2023-03-16 18:58:38] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:58:38] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6404009582282213826
Running compilation step : cd /tmp/ltsmin6404009582282213826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1078 ms.
Running link step : cd /tmp/ltsmin6404009582282213826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6404009582282213826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2283107035100613558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:58:53] [INFO ] Flatten gal took : 47 ms
[2023-03-16 18:58:53] [INFO ] Flatten gal took : 47 ms
[2023-03-16 18:58:53] [INFO ] Time to serialize gal into /tmp/LTL5421410530232053443.gal : 7 ms
[2023-03-16 18:58:53] [INFO ] Time to serialize properties into /tmp/LTL18437875335190662067.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5421410530232053443.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2492092316080004347.hoa' '-atoms' '/tmp/LTL18437875335190662067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18437875335190662067.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2492092316080004347.hoa
Detected timeout of ITS tools.
[2023-03-16 18:59:09] [INFO ] Flatten gal took : 37 ms
[2023-03-16 18:59:09] [INFO ] Flatten gal took : 36 ms
[2023-03-16 18:59:09] [INFO ] Time to serialize gal into /tmp/LTL5585206538402783784.gal : 5 ms
[2023-03-16 18:59:09] [INFO ] Time to serialize properties into /tmp/LTL1912060532010943023.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5585206538402783784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1912060532010943023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((s3_3+s3_2)+(s3_5+s3_4))+((s3_1+s3_0)+(s3_11+s3_10)))+(((s3_13+s3_12)+(s3_7+s3_6))+((s3_9+s3_8)+(s3_18+s3_16))))+((s3_17+...11713
Formula 0 simplified : G(!"(((((((s3_3+s3_2)+(s3_5+s3_4))+((s3_1+s3_0)+(s3_11+s3_10)))+(((s3_13+s3_12)+(s3_7+s3_6))+((s3_9+s3_8)+(s3_18+s3_16))))+((s3_17+s...7874
Detected timeout of ITS tools.
[2023-03-16 18:59:24] [INFO ] Flatten gal took : 33 ms
[2023-03-16 18:59:24] [INFO ] Applying decomposition
[2023-03-16 18:59:24] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3520619967411678685.txt' '-o' '/tmp/graph3520619967411678685.bin' '-w' '/tmp/graph3520619967411678685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3520619967411678685.bin' '-l' '-1' '-v' '-w' '/tmp/graph3520619967411678685.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:59:24] [INFO ] Decomposing Gal with order
[2023-03-16 18:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:59:25] [INFO ] Removed a total of 263 redundant transitions.
[2023-03-16 18:59:25] [INFO ] Flatten gal took : 145 ms
[2023-03-16 18:59:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 44 ms.
[2023-03-16 18:59:25] [INFO ] Time to serialize gal into /tmp/LTL3994899797465195089.gal : 11 ms
[2023-03-16 18:59:25] [INFO ] Time to serialize properties into /tmp/LTL2682172978920629405.ltl : 484 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3994899797465195089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2682172978920629405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((gi1.gi7.gu34.s3_3+gi1.gi7.gu34.s3_2)+(gi1.gi7.gu34.s3_5+gi1.gi7.gu34.s3_4))+((gi1.gi7.gu34.s3_1+gi1.gi7.gu34.s3_0)+(gi1....17686
Formula 0 simplified : G(!"(((((((gi1.gi7.gu34.s3_3+gi1.gi7.gu34.s3_2)+(gi1.gi7.gu34.s3_5+gi1.gi7.gu34.s3_4))+((gi1.gi7.gu34.s3_1+gi1.gi7.gu34.s3_0)+(gi1.g...11947
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8679823881121311855
[2023-03-16 18:59:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8679823881121311855
Running compilation step : cd /tmp/ltsmin8679823881121311855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 965 ms.
Running link step : cd /tmp/ltsmin8679823881121311855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8679823881121311855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-00 finished in 150717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Support contains 382 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 971 are kept as prefixes of interest. Removing 390 places using SCC suffix rule.4 ms
Discarding 390 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 971 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 941 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 941 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 941 transition count 223
Applied a total of 68 rules in 71 ms. Remains 941 /1361 variables (removed 420) and now considering 223/296 (removed 73) transitions.
// Phase 1: matrix 223 rows 941 cols
[2023-03-16 18:59:56] [INFO ] Computed 720 place invariants in 11 ms
[2023-03-16 18:59:56] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-16 18:59:56] [INFO ] Invariant cache hit.
[2023-03-16 18:59:57] [INFO ] Implicit Places using invariants and state equation in 925 ms returned [416]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1474 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1361 places, 223/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1569 ms. Remains : 940/1361 places, 223/296 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10606 reset in 866 ms.
Product exploration explored 100000 steps with 10637 reset in 876 ms.
Computed a total of 940 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 940 transition count 223
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 394 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 223 rows 940 cols
[2023-03-16 19:00:00] [INFO ] Computed 720 place invariants in 13 ms
[2023-03-16 19:00:00] [INFO ] [Real]Absence check using 0 positive and 720 generalized place invariants in 119 ms returned sat
[2023-03-16 19:00:00] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 19:00:01] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 119 ms returned sat
[2023-03-16 19:00:06] [INFO ] After 4916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 19:00:07] [INFO ] After 5972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1187 ms.
[2023-03-16 19:00:08] [INFO ] After 7438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 866 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 13 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-16 19:00:09] [INFO ] Invariant cache hit.
[2023-03-16 19:00:10] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-16 19:00:10] [INFO ] Invariant cache hit.
[2023-03-16 19:00:11] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2023-03-16 19:00:11] [INFO ] Invariant cache hit.
[2023-03-16 19:00:11] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1834 ms. Remains : 940/940 places, 223/223 transitions.
Computed a total of 940 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 940 transition count 223
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 387 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:00:12] [INFO ] Invariant cache hit.
[2023-03-16 19:00:12] [INFO ] [Real]Absence check using 0 positive and 720 generalized place invariants in 120 ms returned sat
[2023-03-16 19:00:12] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 19:00:12] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 123 ms returned sat
[2023-03-16 19:00:17] [INFO ] After 4896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 19:00:20] [INFO ] After 7341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2470 ms.
[2023-03-16 19:00:22] [INFO ] After 10092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10628 reset in 773 ms.
Product exploration explored 100000 steps with 10611 reset in 771 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 35 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-16 19:00:25] [INFO ] Redundant transitions in 19 ms returned [189]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 222 rows 940 cols
[2023-03-16 19:00:25] [INFO ] Computed 720 place invariants in 10 ms
[2023-03-16 19:00:25] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/940 places, 222/223 transitions.
Graph (complete) has 8560 edges and 940 vertex of which 578 are kept as prefixes of interest. Removing 362 places using SCC suffix rule.1 ms
Discarding 362 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 560 transition count 185
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 560 transition count 185
Applied a total of 37 rules in 16 ms. Remains 560 /940 variables (removed 380) and now considering 185/222 (removed 37) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 560/940 places, 185/223 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 467 ms. Remains : 560/940 places, 185/223 transitions.
Built C files in :
/tmp/ltsmin8838100502736518801
[2023-03-16 19:00:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8838100502736518801
Running compilation step : cd /tmp/ltsmin8838100502736518801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 665 ms.
Running link step : cd /tmp/ltsmin8838100502736518801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8838100502736518801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9992998081501347524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 16 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 940 cols
[2023-03-16 19:00:41] [INFO ] Computed 720 place invariants in 7 ms
[2023-03-16 19:00:41] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-16 19:00:41] [INFO ] Invariant cache hit.
[2023-03-16 19:00:42] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2023-03-16 19:00:42] [INFO ] Invariant cache hit.
[2023-03-16 19:00:42] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1862 ms. Remains : 940/940 places, 223/223 transitions.
Built C files in :
/tmp/ltsmin16047464803914819346
[2023-03-16 19:00:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16047464803914819346
Running compilation step : cd /tmp/ltsmin16047464803914819346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 677 ms.
Running link step : cd /tmp/ltsmin16047464803914819346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16047464803914819346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13676770936411233436.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:00:58] [INFO ] Flatten gal took : 28 ms
[2023-03-16 19:00:58] [INFO ] Flatten gal took : 27 ms
[2023-03-16 19:00:58] [INFO ] Time to serialize gal into /tmp/LTL14812378813870798836.gal : 5 ms
[2023-03-16 19:00:58] [INFO ] Time to serialize properties into /tmp/LTL518624026165026749.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14812378813870798836.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17140446422029806451.hoa' '-atoms' '/tmp/LTL518624026165026749.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL518624026165026749.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17140446422029806451.hoa
Detected timeout of ITS tools.
[2023-03-16 19:01:13] [INFO ] Flatten gal took : 23 ms
[2023-03-16 19:01:13] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:01:13] [INFO ] Time to serialize gal into /tmp/LTL10181753030375438833.gal : 3 ms
[2023-03-16 19:01:13] [INFO ] Time to serialize properties into /tmp/LTL6052462405356330841.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10181753030375438833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6052462405356330841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((n7_6_1+n7_7_1)+(n7_4_1+n7_5_1))+((n7_2_1+n7_3_1)+(n7_0_1+n7_1_1)))+(((n7_14_1+n7_15_1)+(n7_12_1+n7_13_1))+((n7_10_1...7410
Formula 0 simplified : FG!"((((((((((n7_6_1+n7_7_1)+(n7_4_1+n7_5_1))+((n7_2_1+n7_3_1)+(n7_0_1+n7_1_1)))+(((n7_14_1+n7_15_1)+(n7_12_1+n7_13_1))+((n7_10_1+n7...7396
Detected timeout of ITS tools.
[2023-03-16 19:01:28] [INFO ] Flatten gal took : 34 ms
[2023-03-16 19:01:28] [INFO ] Applying decomposition
[2023-03-16 19:01:28] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15072476860768580810.txt' '-o' '/tmp/graph15072476860768580810.bin' '-w' '/tmp/graph15072476860768580810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15072476860768580810.bin' '-l' '-1' '-v' '-w' '/tmp/graph15072476860768580810.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:01:28] [INFO ] Decomposing Gal with order
[2023-03-16 19:01:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:01:28] [INFO ] Removed a total of 151 redundant transitions.
[2023-03-16 19:01:28] [INFO ] Flatten gal took : 33 ms
[2023-03-16 19:01:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 16 ms.
[2023-03-16 19:01:28] [INFO ] Time to serialize gal into /tmp/LTL9049013259834044656.gal : 5 ms
[2023-03-16 19:01:28] [INFO ] Time to serialize properties into /tmp/LTL8222148127874257883.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9049013259834044656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8222148127874257883.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((gu26.n7_6_1+gu26.n7_7_1)+(gu26.n7_4_1+gu26.n7_5_1))+((gu26.n7_2_1+gu26.n7_3_1)+(gu26.n7_0_1+gu26.n7_1_1)))+(((gu26....11361
Formula 0 simplified : FG!"((((((((((gu26.n7_6_1+gu26.n7_7_1)+(gu26.n7_4_1+gu26.n7_5_1))+((gu26.n7_2_1+gu26.n7_3_1)+(gu26.n7_0_1+gu26.n7_1_1)))+(((gu26.n7_...11347
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4181429824039329765
[2023-03-16 19:01:43] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4181429824039329765
Running compilation step : cd /tmp/ltsmin4181429824039329765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 679 ms.
Running link step : cd /tmp/ltsmin4181429824039329765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4181429824039329765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-01 finished in 122938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(!p0)))'
Support contains 20 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 47 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-16 19:01:59] [INFO ] Computed 1044 place invariants in 27 ms
[2023-03-16 19:02:00] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2023-03-16 19:02:00] [INFO ] Invariant cache hit.
[2023-03-16 19:02:02] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3690 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3770 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1269 s1270 s1271 s1272) s1268)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 3966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&F(G(!p0))))'
Support contains 40 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1337 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3 place count 1336 transition count 293
Applied a total of 3 rules in 104 ms. Remains 1336 /1361 variables (removed 25) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1336 cols
[2023-03-16 19:02:03] [INFO ] Computed 1045 place invariants in 14 ms
[2023-03-16 19:02:04] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2023-03-16 19:02:04] [INFO ] Invariant cache hit.
[2023-03-16 19:02:06] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned [830]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3592 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1361 places, 293/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3745 ms. Remains : 1335/1361 places, 293/296 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s472 s473 s474 s475 s478 s479 s536 s537 s538 s539 s540 s541 s542 s543 s544 s548 s549 s550 s551) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 ...], 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 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 3878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p0))))'
Support contains 1 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1 are kept as prefixes of interest. Removing 1360 places using SCC suffix rule.2 ms
Discarding 1360 places :
Also discarding 295 output transitions
Drop transitions removed 295 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /1361 variables (removed 1360) and now considering 1/296 (removed 295) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-16 19:02:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-16 19:02:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-16 19:02:06] [INFO ] Invariant cache hit.
[2023-03-16 19:02:06] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-16 19:02:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 19:02:06] [INFO ] Invariant cache hit.
[2023-03-16 19:02:06] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1361 places, 1/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 1/1361 places, 1/296 transitions.
Stuttering acceptance computed with spot in 93 ms :[false, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(!p0))&&F(p1))))))'
Support contains 39 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 40 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-16 19:02:07] [INFO ] Computed 1044 place invariants in 19 ms
[2023-03-16 19:02:08] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2023-03-16 19:02:08] [INFO ] Invariant cache hit.
[2023-03-16 19:02:10] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3599 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3673 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, true, true, true, true, p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 (ADD s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1269 s1270 s1271 s1272)), p1:(LEQ s146 (ADD s20 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-06 finished in 3966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 19 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 970 are kept as prefixes of interest. Removing 391 places using SCC suffix rule.6 ms
Discarding 391 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 969 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 939 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 939 transition count 222
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 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 937 transition count 220
Applied a total of 71 rules in 96 ms. Remains 937 /1361 variables (removed 424) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 937 cols
[2023-03-16 19:02:11] [INFO ] Computed 720 place invariants in 12 ms
[2023-03-16 19:02:12] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-16 19:02:12] [INFO ] Invariant cache hit.
[2023-03-16 19:02:13] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned [413, 757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 897, 898, 899, 900, 903]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2250 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1361 places, 220/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 917 /917 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2376 ms. Remains : 917/1361 places, 220/296 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s854 s855 s856 s857))], 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 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-07 finished in 2535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 113 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:02:13] [INFO ] Computed 1045 place invariants in 27 ms
[2023-03-16 19:02:15] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2023-03-16 19:02:15] [INFO ] Invariant cache hit.
[2023-03-16 19:02:17] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3682 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3835 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ 3 s19) (LEQ 1 s19)), p0:(GT s55 s1337)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-09 finished in 4005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 39 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-16 19:02:17] [INFO ] Computed 1044 place invariants in 21 ms
[2023-03-16 19:02:19] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2023-03-16 19:02:19] [INFO ] Invariant cache hit.
[2023-03-16 19:02:21] [INFO ] Implicit Places using invariants and state equation in 2173 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3394 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3482 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s1319 s66) (LEQ 2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4419 reset in 290 ms.
Product exploration explored 100000 steps with 4415 reset in 265 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2035505 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :{}
Probabilistic random walk after 2035505 steps, saw 286011 distinct states, run finished after 3002 ms. (steps per millisecond=678 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 19:02:25] [INFO ] Computed 1044 place invariants in 103 ms
[2023-03-16 19:02:25] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:02:26] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 185 ms returned sat
[2023-03-16 19:02:26] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:02:26] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-16 19:02:26] [INFO ] After 1055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:02:27] [INFO ] Invariant cache hit.
[2023-03-16 19:02:28] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2023-03-16 19:02:28] [INFO ] Invariant cache hit.
[2023-03-16 19:02:30] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 3339 ms to find 0 implicit places.
[2023-03-16 19:02:30] [INFO ] Invariant cache hit.
[2023-03-16 19:02:30] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3828 ms. Remains : 1337/1337 places, 296/296 transitions.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1914728 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1914728 steps, saw 270213 distinct states, run finished after 3001 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:02:34] [INFO ] Invariant cache hit.
[2023-03-16 19:02:34] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:02:35] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 179 ms returned sat
[2023-03-16 19:02:35] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:02:35] [INFO ] After 771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-16 19:02:35] [INFO ] After 1189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4417 reset in 213 ms.
Product exploration explored 100000 steps with 4419 reset in 224 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 296
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 94 ms. Remains 1317 /1337 variables (removed 20) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:02:37] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 296 rows 1317 cols
[2023-03-16 19:02:37] [INFO ] Computed 1026 place invariants in 106 ms
[2023-03-16 19:02:37] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1317/1337 places, 296/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 683 ms. Remains : 1317/1337 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin2635159551827822398
[2023-03-16 19:02:37] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2635159551827822398
Running compilation step : cd /tmp/ltsmin2635159551827822398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 900 ms.
Running link step : cd /tmp/ltsmin2635159551827822398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2635159551827822398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9569749582660736690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 19:02:53] [INFO ] Computed 1044 place invariants in 111 ms
[2023-03-16 19:02:54] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2023-03-16 19:02:54] [INFO ] Invariant cache hit.
[2023-03-16 19:02:56] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 3410 ms to find 0 implicit places.
[2023-03-16 19:02:56] [INFO ] Invariant cache hit.
[2023-03-16 19:02:56] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3884 ms. Remains : 1337/1337 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin13211122131019399158
[2023-03-16 19:02:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13211122131019399158
Running compilation step : cd /tmp/ltsmin13211122131019399158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 896 ms.
Running link step : cd /tmp/ltsmin13211122131019399158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13211122131019399158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11924527449740302886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:03:11] [INFO ] Flatten gal took : 27 ms
[2023-03-16 19:03:12] [INFO ] Flatten gal took : 27 ms
[2023-03-16 19:03:12] [INFO ] Time to serialize gal into /tmp/LTL13374361072329606514.gal : 6 ms
[2023-03-16 19:03:12] [INFO ] Time to serialize properties into /tmp/LTL17982671106078024987.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13374361072329606514.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4408610092403118690.hoa' '-atoms' '/tmp/LTL17982671106078024987.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17982671106078024987.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4408610092403118690.hoa
Detected timeout of ITS tools.
[2023-03-16 19:03:27] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:03:27] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:03:27] [INFO ] Time to serialize gal into /tmp/LTL15589673551491209428.gal : 5 ms
[2023-03-16 19:03:27] [INFO ] Time to serialize properties into /tmp/LTL15670866991558949226.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15589673551491209428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15670866991558949226.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("((n4_12<=s4_4)||(malicious_reservoir>=2))"))))
Formula 0 simplified : XF!"((n4_12<=s4_4)||(malicious_reservoir>=2))"
Detected timeout of ITS tools.
[2023-03-16 19:03:42] [INFO ] Flatten gal took : 29 ms
[2023-03-16 19:03:42] [INFO ] Applying decomposition
[2023-03-16 19:03:42] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2728736004538878755.txt' '-o' '/tmp/graph2728736004538878755.bin' '-w' '/tmp/graph2728736004538878755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2728736004538878755.bin' '-l' '-1' '-v' '-w' '/tmp/graph2728736004538878755.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:03:42] [INFO ] Decomposing Gal with order
[2023-03-16 19:03:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:03:42] [INFO ] Removed a total of 191 redundant transitions.
[2023-03-16 19:03:42] [INFO ] Flatten gal took : 72 ms
[2023-03-16 19:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 309 labels/synchronizations in 45 ms.
[2023-03-16 19:03:42] [INFO ] Time to serialize gal into /tmp/LTL12484773279922939099.gal : 17 ms
[2023-03-16 19:03:42] [INFO ] Time to serialize properties into /tmp/LTL12927683455093405808.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12484773279922939099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12927683455093405808.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("((gu36.n4_12<=gu36.s4_4)||(gu0.malicious_reservoir>=2))"))))
Formula 0 simplified : XF!"((gu36.n4_12<=gu36.s4_4)||(gu0.malicious_reservoir>=2))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3058396367170060751
[2023-03-16 19:03:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3058396367170060751
Running compilation step : cd /tmp/ltsmin3058396367170060751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 903 ms.
Running link step : cd /tmp/ltsmin3058396367170060751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3058396367170060751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 115028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&G(p2)))))'
Support contains 5 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 40 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:04:12] [INFO ] Computed 1045 place invariants in 34 ms
[2023-03-16 19:04:14] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2023-03-16 19:04:14] [INFO ] Invariant cache hit.
[2023-03-16 19:04:16] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3516 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3594 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LEQ 1 s52), p0:(GT s37 s1296), p1:(LEQ s147 s1159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 20 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 3767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0)&&X(p1))))))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 38 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-16 19:04:16] [INFO ] Computed 1044 place invariants in 16 ms
[2023-03-16 19:04:17] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2023-03-16 19:04:17] [INFO ] Invariant cache hit.
[2023-03-16 19:04:20] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3711 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3783 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s125 s736), p1:(LEQ 1 s541)], 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-13 finished in 4019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Support contains 2 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 39 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:04:20] [INFO ] Computed 1044 place invariants in 18 ms
[2023-03-16 19:04:21] [INFO ] Implicit Places using invariants in 1298 ms returned []
[2023-03-16 19:04:21] [INFO ] Invariant cache hit.
[2023-03-16 19:04:24] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3870 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3945 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s1269 s1120)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4419 reset in 219 ms.
Product exploration explored 100000 steps with 4423 reset in 245 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2106649 steps, run timeout after 3001 ms. (steps per millisecond=701 ) properties seen :{}
Probabilistic random walk after 2106649 steps, saw 295779 distinct states, run finished after 3001 ms. (steps per millisecond=701 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-16 19:04:28] [INFO ] Computed 1044 place invariants in 31 ms
[2023-03-16 19:04:28] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:04:29] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 179 ms returned sat
[2023-03-16 19:04:29] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:04:29] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-16 19:04:29] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:04:30] [INFO ] Invariant cache hit.
[2023-03-16 19:04:31] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2023-03-16 19:04:31] [INFO ] Invariant cache hit.
[2023-03-16 19:04:33] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 3535 ms to find 0 implicit places.
[2023-03-16 19:04:33] [INFO ] Invariant cache hit.
[2023-03-16 19:04:34] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4008 ms. Remains : 1338/1338 places, 296/296 transitions.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 440 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1972134 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :{}
Probabilistic random walk after 1972134 steps, saw 278181 distinct states, run finished after 3001 ms. (steps per millisecond=657 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:04:37] [INFO ] Invariant cache hit.
[2023-03-16 19:04:37] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:04:38] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 184 ms returned sat
[2023-03-16 19:04:38] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:04:38] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-16 19:04:38] [INFO ] After 807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 715 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4416 reset in 215 ms.
Product exploration explored 100000 steps with 4417 reset in 222 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 970 are kept as prefixes of interest. Removing 368 places using SCC suffix rule.6 ms
Discarding 368 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 940 transition count 225
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 69 rules in 77 ms. Remains 940 /1338 variables (removed 398) and now considering 225/296 (removed 71) transitions.
[2023-03-16 19:04:40] [INFO ] Redundant transitions in 22 ms returned [188]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 224 rows 940 cols
[2023-03-16 19:04:40] [INFO ] Computed 720 place invariants in 6 ms
[2023-03-16 19:04:40] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1338 places, 224/296 transitions.
Graph (complete) has 8955 edges and 940 vertex of which 597 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.2 ms
Discarding 343 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 597 transition count 224
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 597 transition count 224
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 20 place count 580 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 37 place count 580 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 37 rules in 22 ms. Remains 580 /940 variables (removed 360) and now considering 190/224 (removed 34) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 580/1338 places, 190/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 580/1338 places, 190/296 transitions.
Built C files in :
/tmp/ltsmin9526714089719933329
[2023-03-16 19:04:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9526714089719933329
Running compilation step : cd /tmp/ltsmin9526714089719933329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 910 ms.
Running link step : cd /tmp/ltsmin9526714089719933329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9526714089719933329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16702211035211643616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-16 19:04:55] [INFO ] Computed 1044 place invariants in 26 ms
[2023-03-16 19:04:56] [INFO ] Implicit Places using invariants in 1246 ms returned []
[2023-03-16 19:04:56] [INFO ] Invariant cache hit.
[2023-03-16 19:04:59] [INFO ] Implicit Places using invariants and state equation in 2319 ms returned []
Implicit Place search using SMT with State Equation took 3573 ms to find 0 implicit places.
[2023-03-16 19:04:59] [INFO ] Invariant cache hit.
[2023-03-16 19:04:59] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4051 ms. Remains : 1338/1338 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin10000278876383296554
[2023-03-16 19:04:59] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10000278876383296554
Running compilation step : cd /tmp/ltsmin10000278876383296554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1264 ms.
Running link step : cd /tmp/ltsmin10000278876383296554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10000278876383296554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12307016484766847720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:05:14] [INFO ] Flatten gal took : 36 ms
[2023-03-16 19:05:14] [INFO ] Flatten gal took : 28 ms
[2023-03-16 19:05:14] [INFO ] Time to serialize gal into /tmp/LTL427395333362406766.gal : 5 ms
[2023-03-16 19:05:14] [INFO ] Time to serialize properties into /tmp/LTL16710057912538532900.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL427395333362406766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4154117436252445351.hoa' '-atoms' '/tmp/LTL16710057912538532900.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16710057912538532900.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4154117436252445351.hoa
Detected timeout of ITS tools.
[2023-03-16 19:05:30] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:05:30] [INFO ] Flatten gal took : 24 ms
[2023-03-16 19:05:30] [INFO ] Time to serialize gal into /tmp/LTL582425939297733016.gal : 5 ms
[2023-03-16 19:05:30] [INFO ] Time to serialize properties into /tmp/LTL10053643055272435424.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL582425939297733016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10053643055272435424.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(AstopOK<=n8_16_16)"))||(X(G("(AstopOK>n8_16_16)")))))
Formula 0 simplified : F!"(AstopOK<=n8_16_16)" & XF!"(AstopOK>n8_16_16)"
Detected timeout of ITS tools.
[2023-03-16 19:05:45] [INFO ] Flatten gal took : 29 ms
[2023-03-16 19:05:45] [INFO ] Applying decomposition
[2023-03-16 19:05:45] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1893803585401402517.txt' '-o' '/tmp/graph1893803585401402517.bin' '-w' '/tmp/graph1893803585401402517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1893803585401402517.bin' '-l' '-1' '-v' '-w' '/tmp/graph1893803585401402517.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:05:45] [INFO ] Decomposing Gal with order
[2023-03-16 19:05:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:05:45] [INFO ] Removed a total of 190 redundant transitions.
[2023-03-16 19:05:45] [INFO ] Flatten gal took : 68 ms
[2023-03-16 19:05:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 46 ms.
[2023-03-16 19:05:45] [INFO ] Time to serialize gal into /tmp/LTL7256096003532969950.gal : 11 ms
[2023-03-16 19:05:45] [INFO ] Time to serialize properties into /tmp/LTL8148383728613814.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7256096003532969950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8148383728613814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...272
Read 1 LTL properties
Checking formula 0 : !(((G("(gu82.AstopOK<=gu82.n8_16_16)"))||(X(G("(gu82.AstopOK>gu82.n8_16_16)")))))
Formula 0 simplified : F!"(gu82.AstopOK<=gu82.n8_16_16)" & XF!"(gu82.AstopOK>gu82.n8_16_16)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8598753028712407737
[2023-03-16 19:06:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8598753028712407737
Running compilation step : cd /tmp/ltsmin8598753028712407737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 927 ms.
Running link step : cd /tmp/ltsmin8598753028712407737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8598753028712407737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X([](!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 115163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-10
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1318 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.11 ms
Discarding 43 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 5 place count 1315 transition count 291
Applied a total of 5 rules in 93 ms. Remains 1315 /1361 variables (removed 46) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1315 cols
[2023-03-16 19:06:16] [INFO ] Computed 1026 place invariants in 18 ms
[2023-03-16 19:06:17] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2023-03-16 19:06:17] [INFO ] Invariant cache hit.
[2023-03-16 19:06:19] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned [810, 1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1275, 1276, 1277, 1278, 1281]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 3386 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1295/1361 places, 291/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3520 ms. Remains : 1295/1361 places, 291/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s1277 s66) (LEQ 2 s0))], 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][false, false, false]]
Product exploration explored 100000 steps with 4211 reset in 241 ms.
Product exploration explored 100000 steps with 4204 reset in 257 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 420 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2301045 steps, run timeout after 3001 ms. (steps per millisecond=766 ) properties seen :{}
Probabilistic random walk after 2301045 steps, saw 319846 distinct states, run finished after 3003 ms. (steps per millisecond=766 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 1295 cols
[2023-03-16 19:06:23] [INFO ] Computed 1008 place invariants in 71 ms
[2023-03-16 19:06:23] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:06:24] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 175 ms returned sat
[2023-03-16 19:06:24] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:06:24] [INFO ] After 666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-16 19:06:24] [INFO ] After 1068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 598 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 32 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-16 19:06:25] [INFO ] Invariant cache hit.
[2023-03-16 19:06:26] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2023-03-16 19:06:26] [INFO ] Invariant cache hit.
[2023-03-16 19:06:28] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
[2023-03-16 19:06:28] [INFO ] Invariant cache hit.
[2023-03-16 19:06:29] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3633 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 479 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 420 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2541162 steps, run timeout after 3001 ms. (steps per millisecond=846 ) properties seen :{}
Probabilistic random walk after 2541162 steps, saw 352167 distinct states, run finished after 3001 ms. (steps per millisecond=846 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:06:33] [INFO ] Invariant cache hit.
[2023-03-16 19:06:33] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:06:33] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 164 ms returned sat
[2023-03-16 19:06:34] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:06:34] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-16 19:06:34] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 767 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4207 reset in 250 ms.
Product exploration explored 100000 steps with 4207 reset in 259 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 43 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-16 19:06:36] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 19:06:36] [INFO ] Invariant cache hit.
[2023-03-16 19:06:36] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 1295/1295 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin10201622494164309818
[2023-03-16 19:06:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10201622494164309818
Running compilation step : cd /tmp/ltsmin10201622494164309818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 845 ms.
Running link step : cd /tmp/ltsmin10201622494164309818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10201622494164309818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11298979388664091721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 42 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-16 19:06:51] [INFO ] Invariant cache hit.
[2023-03-16 19:06:53] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-16 19:06:53] [INFO ] Invariant cache hit.
[2023-03-16 19:06:55] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
[2023-03-16 19:06:55] [INFO ] Invariant cache hit.
[2023-03-16 19:06:55] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3701 ms. Remains : 1295/1295 places, 291/291 transitions.
Built C files in :
/tmp/ltsmin3993771423951546596
[2023-03-16 19:06:55] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3993771423951546596
Running compilation step : cd /tmp/ltsmin3993771423951546596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 858 ms.
Running link step : cd /tmp/ltsmin3993771423951546596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3993771423951546596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6873458351004406024.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:07:10] [INFO ] Flatten gal took : 24 ms
[2023-03-16 19:07:10] [INFO ] Flatten gal took : 36 ms
[2023-03-16 19:07:10] [INFO ] Time to serialize gal into /tmp/LTL15776895296098333329.gal : 5 ms
[2023-03-16 19:07:10] [INFO ] Time to serialize properties into /tmp/LTL17441606539784445357.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15776895296098333329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12556503273963975453.hoa' '-atoms' '/tmp/LTL17441606539784445357.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17441606539784445357.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12556503273963975453.hoa
Detected timeout of ITS tools.
[2023-03-16 19:07:25] [INFO ] Flatten gal took : 24 ms
[2023-03-16 19:07:25] [INFO ] Flatten gal took : 24 ms
[2023-03-16 19:07:25] [INFO ] Time to serialize gal into /tmp/LTL4456056215013063682.gal : 4 ms
[2023-03-16 19:07:25] [INFO ] Time to serialize properties into /tmp/LTL16941738049593264318.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4456056215013063682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16941738049593264318.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((n4_12<=s4_4)||(malicious_reservoir>=2))"))))
Formula 0 simplified : XF!"((n4_12<=s4_4)||(malicious_reservoir>=2))"
Detected timeout of ITS tools.
[2023-03-16 19:07:40] [INFO ] Flatten gal took : 29 ms
[2023-03-16 19:07:40] [INFO ] Applying decomposition
[2023-03-16 19:07:40] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14280621466230214762.txt' '-o' '/tmp/graph14280621466230214762.bin' '-w' '/tmp/graph14280621466230214762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14280621466230214762.bin' '-l' '-1' '-v' '-w' '/tmp/graph14280621466230214762.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:07:40] [INFO ] Decomposing Gal with order
[2023-03-16 19:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:07:41] [INFO ] Removed a total of 210 redundant transitions.
[2023-03-16 19:07:41] [INFO ] Flatten gal took : 64 ms
[2023-03-16 19:07:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 414 labels/synchronizations in 44 ms.
[2023-03-16 19:07:41] [INFO ] Time to serialize gal into /tmp/LTL6074327310157068574.gal : 13 ms
[2023-03-16 19:07:41] [INFO ] Time to serialize properties into /tmp/LTL11563655512563081891.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6074327310157068574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11563655512563081891.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((gu32.n4_12<=gu32.s4_4)||(gu0.malicious_reservoir>=2))"))))
Formula 0 simplified : XF!"((gu32.n4_12<=gu32.s4_4)||(gu0.malicious_reservoir>=2))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3691198674433808242
[2023-03-16 19:07:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3691198674433808242
Running compilation step : cd /tmp/ltsmin3691198674433808242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 885 ms.
Running link step : cd /tmp/ltsmin3691198674433808242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3691198674433808242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 115429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-14
Stuttering acceptance computed with spot in 161 ms :[true, p0, (NOT p0), false, false]
Support contains 2 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 971 are kept as prefixes of interest. Removing 390 places using SCC suffix rule.4 ms
Discarding 390 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 222
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 1 with 4 rules applied. Total rules applied 71 place count 938 transition count 220
Applied a total of 71 rules in 81 ms. Remains 938 /1361 variables (removed 423) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 938 cols
[2023-03-16 19:08:11] [INFO ] Computed 720 place invariants in 7 ms
[2023-03-16 19:08:12] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-16 19:08:12] [INFO ] Invariant cache hit.
[2023-03-16 19:08:14] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned [413, 757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 898, 899, 900, 901, 904]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2322 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 918/1361 places, 220/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2428 ms. Remains : 918/1361 places, 220/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s854 s720)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4162 reset in 251 ms.
Product exploration explored 100000 steps with 4155 reset in 261 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 383 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2434253 steps, run timeout after 3001 ms. (steps per millisecond=811 ) properties seen :{}
Probabilistic random walk after 2434253 steps, saw 335046 distinct states, run finished after 3001 ms. (steps per millisecond=811 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 918 cols
[2023-03-16 19:08:18] [INFO ] Computed 702 place invariants in 7 ms
[2023-03-16 19:08:18] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:08:18] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 111 ms returned sat
[2023-03-16 19:08:18] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:08:18] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-16 19:08:18] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 87 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 23 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-16 19:08:19] [INFO ] Invariant cache hit.
[2023-03-16 19:08:20] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-16 19:08:20] [INFO ] Invariant cache hit.
[2023-03-16 19:08:21] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2023-03-16 19:08:21] [INFO ] Invariant cache hit.
[2023-03-16 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2605 ms. Remains : 918/918 places, 220/220 transitions.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2434253 steps, run timeout after 3001 ms. (steps per millisecond=811 ) properties seen :{}
Probabilistic random walk after 2434253 steps, saw 335046 distinct states, run finished after 3001 ms. (steps per millisecond=811 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:08:25] [INFO ] Invariant cache hit.
[2023-03-16 19:08:25] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:08:25] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 104 ms returned sat
[2023-03-16 19:08:25] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:08:25] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 19:08:25] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 74 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4153 reset in 243 ms.
Product exploration explored 100000 steps with 4152 reset in 260 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 26 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-16 19:08:27] [INFO ] Redundant transitions in 38 ms returned [183]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 219 rows 918 cols
[2023-03-16 19:08:27] [INFO ] Computed 702 place invariants in 4 ms
[2023-03-16 19:08:27] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8857 edges and 918 vertex of which 575 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.1 ms
Discarding 343 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 575 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 575 transition count 219
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 20 place count 558 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 37 place count 558 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 37 rules in 21 ms. Remains 558 /918 variables (removed 360) and now considering 185/219 (removed 34) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 558/918 places, 185/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 558/918 places, 185/220 transitions.
Built C files in :
/tmp/ltsmin7966291342251305246
[2023-03-16 19:08:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7966291342251305246
Running compilation step : cd /tmp/ltsmin7966291342251305246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 624 ms.
Running link step : cd /tmp/ltsmin7966291342251305246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7966291342251305246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18019500178459538985.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 19 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 918 cols
[2023-03-16 19:08:42] [INFO ] Computed 702 place invariants in 5 ms
[2023-03-16 19:08:43] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-16 19:08:43] [INFO ] Invariant cache hit.
[2023-03-16 19:08:44] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-16 19:08:44] [INFO ] Invariant cache hit.
[2023-03-16 19:08:44] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2461 ms. Remains : 918/918 places, 220/220 transitions.
Built C files in :
/tmp/ltsmin17831501996333526675
[2023-03-16 19:08:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17831501996333526675
Running compilation step : cd /tmp/ltsmin17831501996333526675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 611 ms.
Running link step : cd /tmp/ltsmin17831501996333526675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17831501996333526675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5457363675017588933.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:09:00] [INFO ] Flatten gal took : 18 ms
[2023-03-16 19:09:00] [INFO ] Flatten gal took : 23 ms
[2023-03-16 19:09:00] [INFO ] Time to serialize gal into /tmp/LTL1949947859594775267.gal : 3 ms
[2023-03-16 19:09:00] [INFO ] Time to serialize properties into /tmp/LTL14457708476321818315.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1949947859594775267.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8622532558440465663.hoa' '-atoms' '/tmp/LTL14457708476321818315.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14457708476321818315.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8622532558440465663.hoa
Detected timeout of ITS tools.
[2023-03-16 19:09:15] [INFO ] Flatten gal took : 18 ms
[2023-03-16 19:09:15] [INFO ] Flatten gal took : 36 ms
[2023-03-16 19:09:15] [INFO ] Time to serialize gal into /tmp/LTL10187741987582189405.gal : 3 ms
[2023-03-16 19:09:15] [INFO ] Time to serialize properties into /tmp/LTL1226083259385958909.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10187741987582189405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1226083259385958909.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(AstopOK<=n8_16_16)"))||(X(G("(AstopOK>n8_16_16)")))))
Formula 0 simplified : F!"(AstopOK<=n8_16_16)" & XF!"(AstopOK>n8_16_16)"
Detected timeout of ITS tools.
[2023-03-16 19:09:30] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:09:30] [INFO ] Applying decomposition
[2023-03-16 19:09:30] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11149255045779998160.txt' '-o' '/tmp/graph11149255045779998160.bin' '-w' '/tmp/graph11149255045779998160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11149255045779998160.bin' '-l' '-1' '-v' '-w' '/tmp/graph11149255045779998160.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:09:30] [INFO ] Decomposing Gal with order
[2023-03-16 19:09:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:09:30] [INFO ] Removed a total of 171 redundant transitions.
[2023-03-16 19:09:30] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:09:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 7 ms.
[2023-03-16 19:09:30] [INFO ] Time to serialize gal into /tmp/LTL14038316593601995818.gal : 3 ms
[2023-03-16 19:09:30] [INFO ] Time to serialize properties into /tmp/LTL5489204813358385648.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14038316593601995818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5489204813358385648.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(gu33.AstopOK<=gu33.n8_16_16)"))||(X(G("(gu33.AstopOK>gu33.n8_16_16)")))))
Formula 0 simplified : F!"(gu33.AstopOK<=gu33.n8_16_16)" & XF!"(gu33.AstopOK>gu33.n8_16_16)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9522696309015846310
[2023-03-16 19:09:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9522696309015846310
Running compilation step : cd /tmp/ltsmin9522696309015846310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 621 ms.
Running link step : cd /tmp/ltsmin9522696309015846310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9522696309015846310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X([](!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 109323 ms.
[2023-03-16 19:10:00] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17041130025678659089
[2023-03-16 19:10:00] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-16 19:10:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:00] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-16 19:10:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:00] [INFO ] Applying decomposition
[2023-03-16 19:10:00] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-16 19:10:00] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:00] [INFO ] Flatten gal took : 32 ms
[2023-03-16 19:10:00] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17041130025678659089
Running compilation step : cd /tmp/ltsmin17041130025678659089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15313711444704174055.txt' '-o' '/tmp/graph15313711444704174055.bin' '-w' '/tmp/graph15313711444704174055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15313711444704174055.bin' '-l' '-1' '-v' '-w' '/tmp/graph15313711444704174055.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:10:01] [INFO ] Decomposing Gal with order
[2023-03-16 19:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:10:01] [INFO ] Removed a total of 61 redundant transitions.
[2023-03-16 19:10:01] [INFO ] Flatten gal took : 52 ms
[2023-03-16 19:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-16 19:10:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality11175842670619015407.gal : 6 ms
[2023-03-16 19:10:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality12427906925520180972.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11175842670619015407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12427906925520180972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !((F(("(((((((gi1.gu12.s3_3+gi1.gu12.s3_2)+(gi1.gu12.s3_5+gi1.gu12.s3_4))+((gi1.gu12.s3_1+gi1.gu12.s3_0)+(gi1.gu12.s3_11+gi1.gu12.s3_1...17602
Formula 0 simplified : G(!"(((((((gi1.gu12.s3_3+gi1.gu12.s3_2)+(gi1.gu12.s3_5+gi1.gu12.s3_4))+((gi1.gu12.s3_1+gi1.gu12.s3_0)+(gi1.gu12.s3_11+gi1.gu12.s3_10...11863
Compilation finished in 1239 ms.
Running link step : cd /tmp/ltsmin17041130025678659089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17041130025678659089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: Initializing POR dependencies: labels 304, guards 296
pins2lts-mc-linux64( 7/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 2.666: LTL layer: formula: <>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 2.667: "<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 2.667: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.936: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.965: There are 305 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.965: State length is 1362, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 2.965: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.965: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.965: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.965: Visible groups: 0 / 300, labels: 3 / 305
pins2lts-mc-linux64( 0/ 8), 2.965: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.965: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 3.047: [Blue] ~26 levels ~960 states ~4992 transitions
pins2lts-mc-linux64( 7/ 8), 3.069: [Blue] ~26 levels ~1920 states ~7104 transitions
pins2lts-mc-linux64( 7/ 8), 3.146: [Blue] ~27 levels ~3840 states ~10704 transitions
pins2lts-mc-linux64( 7/ 8), 3.302: [Blue] ~27 levels ~7680 states ~19064 transitions
pins2lts-mc-linux64( 7/ 8), 3.649: [Blue] ~27 levels ~15360 states ~35928 transitions
pins2lts-mc-linux64( 6/ 8), 4.261: [Blue] ~26 levels ~30720 states ~68752 transitions
pins2lts-mc-linux64( 4/ 8), 5.401: [Blue] ~25 levels ~61440 states ~148816 transitions
pins2lts-mc-linux64( 4/ 8), 8.020: [Blue] ~25 levels ~122880 states ~380216 transitions
pins2lts-mc-linux64( 4/ 8), 12.991: [Blue] ~25 levels ~245760 states ~802224 transitions
pins2lts-mc-linux64( 6/ 8), 22.740: [Blue] ~27 levels ~491520 states ~1676056 transitions
pins2lts-mc-linux64( 6/ 8), 45.115: [Blue] ~27 levels ~983040 states ~3972640 transitions
pins2lts-mc-linux64( 6/ 8), 89.802: [Blue] ~27 levels ~1966080 states ~8481264 transitions
pins2lts-mc-linux64( 4/ 8), 179.780: [Blue] ~27 levels ~3932160 states ~17704776 transitions
pins2lts-mc-linux64( 4/ 8), 367.882: [Blue] ~27 levels ~7864320 states ~37082568 transitions
pins2lts-mc-linux64( 4/ 8), 791.438: [Blue] ~28 levels ~15728640 states ~80952192 transitions
pins2lts-mc-linux64( 4/ 8), 861.445: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 861.710:
pins2lts-mc-linux64( 0/ 8), 861.710: Explored 15409037 states 90104717 transitions, fanout: 5.848
pins2lts-mc-linux64( 0/ 8), 861.710: Total exploration time 858.750 sec (858.480 sec minimum, 858.628 sec on average)
pins2lts-mc-linux64( 0/ 8), 861.710: States per second: 17944, Transitions per second: 104925
pins2lts-mc-linux64( 0/ 8), 861.710:
pins2lts-mc-linux64( 0/ 8), 861.710: State space has 15411259 states, 15407744 are accepting
pins2lts-mc-linux64( 0/ 8), 861.710: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 861.710: blue states: 15409037 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 861.710: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 861.710: all-red states: 15407744 (99.98%), bogus 501 (0.00%)
pins2lts-mc-linux64( 0/ 8), 861.710:
pins2lts-mc-linux64( 0/ 8), 861.710: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 861.710:
pins2lts-mc-linux64( 0/ 8), 861.710: Queue width: 8B, total height: 223, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 861.710: Tree memory: 373.6MB, 25.4 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 861.710: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 861.710: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 861.710: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 861.710: Est. total memory use: 373.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17041130025678659089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17041130025678659089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 19:34:30] [INFO ] Flatten gal took : 647 ms
[2023-03-16 19:34:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality2900823262238693740.gal : 35 ms
[2023-03-16 19:34:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality15382883754814747556.ltl : 59 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2900823262238693740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15382883754814747556.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((F(("(((((((s3_3+s3_2)+(s3_5+s3_4))+((s3_1+s3_0)+(s3_11+s3_10)))+(((s3_13+s3_12)+(s3_7+s3_6))+((s3_9+s3_8)+(s3_18+s3_16))))+((s3_17+...11713
Formula 0 simplified : G(!"(((((((s3_3+s3_2)+(s3_5+s3_4))+((s3_1+s3_0)+(s3_11+s3_10)))+(((s3_13+s3_12)+(s3_7+s3_6))+((s3_9+s3_8)+(s3_18+s3_16))))+((s3_17+s...7874
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136700 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11267680 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-18, 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 r293-tall-167873946000883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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