Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789200418.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716988251382

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 13:10:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:10:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:10:53] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-29 13:10:53] [INFO ] Transformed 3123 places.
[2024-05-29 13:10:53] [INFO ] Transformed 2843 transitions.
[2024-05-29 13:10:53] [INFO ] Found NUPN structural information;
[2024-05-29 13:10:53] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 2696 transition count 2416
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 2696 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 2695 transition count 2415
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 2695 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 2694 transition count 2414
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 2694 transition count 2414
Applied a total of 858 rules in 1131 ms. Remains 2694 /3123 variables (removed 429) and now considering 2414/2843 (removed 429) transitions.
// Phase 1: matrix 2414 rows 2694 cols
[2024-05-29 13:10:55] [INFO ] Computed 441 invariants in 46 ms
[2024-05-29 13:10:56] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2024-05-29 13:10:56] [INFO ] Invariant cache hit.
[2024-05-29 13:10:59] [INFO ] Implicit Places using invariants and state equation in 2866 ms returned []
Implicit Place search using SMT with State Equation took 4011 ms to find 0 implicit places.
[2024-05-29 13:10:59] [INFO ] Invariant cache hit.
[2024-05-29 13:11:01] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2694/3123 places, 2414/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7114 ms. Remains : 2694/3123 places, 2414/2843 transitions.
Support contains 28 out of 2694 places after structural reductions.
[2024-05-29 13:11:01] [INFO ] Flatten gal took : 177 ms
[2024-05-29 13:11:01] [INFO ] Flatten gal took : 106 ms
[2024-05-29 13:11:01] [INFO ] Input system was already deterministic with 2414 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 26) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-29 13:11:02] [INFO ] Invariant cache hit.
[2024-05-29 13:11:03] [INFO ] After 1045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-29 13:11:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 174 ms returned sat
[2024-05-29 13:11:07] [INFO ] After 2514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 16 places in 568 ms of which 9 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 22 places in 529 ms of which 2 ms to minimize.
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 25 places in 571 ms of which 2 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 26 places in 560 ms of which 2 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 19 places in 548 ms of which 3 ms to minimize.
[2024-05-29 13:11:11] [INFO ] Deduced a trap composed of 23 places in 539 ms of which 1 ms to minimize.
[2024-05-29 13:11:12] [INFO ] Deduced a trap composed of 19 places in 532 ms of which 2 ms to minimize.
[2024-05-29 13:11:12] [INFO ] Deduced a trap composed of 17 places in 513 ms of which 1 ms to minimize.
[2024-05-29 13:11:13] [INFO ] Deduced a trap composed of 23 places in 514 ms of which 2 ms to minimize.
[2024-05-29 13:11:13] [INFO ] Deduced a trap composed of 21 places in 488 ms of which 1 ms to minimize.
[2024-05-29 13:11:14] [INFO ] Deduced a trap composed of 36 places in 474 ms of which 1 ms to minimize.
[2024-05-29 13:11:15] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 1 ms to minimize.
[2024-05-29 13:11:15] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 1 ms to minimize.
[2024-05-29 13:11:16] [INFO ] Deduced a trap composed of 21 places in 471 ms of which 1 ms to minimize.
[2024-05-29 13:11:16] [INFO ] Deduced a trap composed of 22 places in 458 ms of which 1 ms to minimize.
[2024-05-29 13:11:17] [INFO ] Deduced a trap composed of 45 places in 459 ms of which 1 ms to minimize.
[2024-05-29 13:11:17] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 1 ms to minimize.
[2024-05-29 13:11:18] [INFO ] Deduced a trap composed of 24 places in 448 ms of which 1 ms to minimize.
[2024-05-29 13:11:18] [INFO ] Deduced a trap composed of 27 places in 442 ms of which 1 ms to minimize.
[2024-05-29 13:11:19] [INFO ] Deduced a trap composed of 29 places in 525 ms of which 2 ms to minimize.
[2024-05-29 13:11:19] [INFO ] Deduced a trap composed of 26 places in 408 ms of which 1 ms to minimize.
[2024-05-29 13:11:20] [INFO ] Deduced a trap composed of 28 places in 451 ms of which 1 ms to minimize.
[2024-05-29 13:11:21] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 1 ms to minimize.
[2024-05-29 13:11:21] [INFO ] Deduced a trap composed of 21 places in 403 ms of which 2 ms to minimize.
[2024-05-29 13:11:21] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 1 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 27 places in 394 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 38 places in 339 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 5 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 1 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 13:11:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:11:28] [INFO ] After 25126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1215 ms.
Support contains 19 out of 2694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 2694 transition count 1863
Reduce places removed 551 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 552 rules applied. Total rules applied 1103 place count 2143 transition count 1862
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1104 place count 2142 transition count 1862
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 310 Pre rules applied. Total rules applied 1104 place count 2142 transition count 1552
Deduced a syphon composed of 310 places in 2 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1724 place count 1832 transition count 1552
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1726 place count 1830 transition count 1550
Iterating global reduction 3 with 2 rules applied. Total rules applied 1728 place count 1830 transition count 1550
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1728 place count 1830 transition count 1549
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1730 place count 1829 transition count 1549
Performed 688 Post agglomeration using F-continuation condition.Transition count delta: 688
Deduced a syphon composed of 688 places in 1 ms
Reduce places removed 688 places and 0 transitions.
Iterating global reduction 3 with 1376 rules applied. Total rules applied 3106 place count 1141 transition count 861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3107 place count 1141 transition count 860
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3109 place count 1140 transition count 859
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3311 place count 1039 transition count 859
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 3337 place count 1026 transition count 859
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3339 place count 1026 transition count 857
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3341 place count 1024 transition count 857
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 5 with 117 rules applied. Total rules applied 3458 place count 1024 transition count 857
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3459 place count 1023 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3460 place count 1022 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3460 place count 1022 transition count 854
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3464 place count 1020 transition count 854
Applied a total of 3464 rules in 710 ms. Remains 1020 /2694 variables (removed 1674) and now considering 854/2414 (removed 1560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 1020/2694 places, 854/2414 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 854 rows 1020 cols
[2024-05-29 13:11:31] [INFO ] Computed 440 invariants in 8 ms
[2024-05-29 13:11:32] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 13:11:32] [INFO ] [Nat]Absence check using 440 positive place invariants in 75 ms returned sat
[2024-05-29 13:11:33] [INFO ] After 806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-29 13:11:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 13:11:34] [INFO ] After 447ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2024-05-29 13:11:35] [INFO ] After 1485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 455 ms.
[2024-05-29 13:11:35] [INFO ] After 3340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 108 ms.
Support contains 10 out of 1020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1020/1020 places, 854/854 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1020 transition count 848
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1014 transition count 848
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 1011 transition count 845
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 1009 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 1008 transition count 844
Applied a total of 23 rules in 103 ms. Remains 1008 /1020 variables (removed 12) and now considering 844/854 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 1008/1020 places, 844/854 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 108056 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108056 steps, saw 90031 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 844 rows 1008 cols
[2024-05-29 13:11:39] [INFO ] Computed 440 invariants in 3 ms
[2024-05-29 13:11:39] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 13:11:40] [INFO ] [Nat]Absence check using 440 positive place invariants in 64 ms returned sat
[2024-05-29 13:11:40] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 13:11:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:11:41] [INFO ] After 282ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 13:11:41] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 282 ms.
[2024-05-29 13:11:41] [INFO ] After 2006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 10 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 844/844 transitions.
Applied a total of 0 rules in 26 ms. Remains 1008 /1008 variables (removed 0) and now considering 844/844 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1008/1008 places, 844/844 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 844/844 transitions.
Applied a total of 0 rules in 26 ms. Remains 1008 /1008 variables (removed 0) and now considering 844/844 (removed 0) transitions.
[2024-05-29 13:11:41] [INFO ] Invariant cache hit.
[2024-05-29 13:11:42] [INFO ] Implicit Places using invariants in 615 ms returned [991, 995]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 618 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1006/1008 places, 844/844 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 842
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 842
Applied a total of 4 rules in 38 ms. Remains 1004 /1006 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2024-05-29 13:11:42] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:11:43] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 13:11:43] [INFO ] Invariant cache hit.
[2024-05-29 13:11:44] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1004/1008 places, 842/844 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2445 ms. Remains : 1004/1008 places, 842/844 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 111955 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111955 steps, saw 92967 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-29 13:11:48] [INFO ] Invariant cache hit.
[2024-05-29 13:11:48] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 13:11:48] [INFO ] [Nat]Absence check using 438 positive place invariants in 67 ms returned sat
[2024-05-29 13:11:49] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 13:11:49] [INFO ] After 992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 261 ms.
[2024-05-29 13:11:50] [INFO ] After 1663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 10 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 23 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1004/1004 places, 842/842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 23 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-29 13:11:50] [INFO ] Invariant cache hit.
[2024-05-29 13:11:50] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-29 13:11:50] [INFO ] Invariant cache hit.
[2024-05-29 13:11:52] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-29 13:11:52] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-29 13:11:52] [INFO ] Invariant cache hit.
[2024-05-29 13:11:52] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2608 ms. Remains : 1004/1004 places, 842/842 transitions.
Partial Free-agglomeration rule applied 228 times.
Drop transitions removed 228 transitions
Iterating global reduction 0 with 228 rules applied. Total rules applied 228 place count 1004 transition count 842
Applied a total of 228 rules in 113 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 842 rows 1004 cols
[2024-05-29 13:11:52] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:11:53] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 13:11:53] [INFO ] [Nat]Absence check using 438 positive place invariants in 77 ms returned sat
[2024-05-29 13:11:54] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 13:11:54] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-29 13:11:54] [INFO ] After 415ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 13:11:54] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2024-05-29 13:11:55] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2024-05-29 13:11:55] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-29 13:11:55] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2024-05-29 13:11:55] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 2 ms to minimize.
[2024-05-29 13:11:55] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 13:11:56] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:11:56] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2024-05-29 13:11:56] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2024-05-29 13:11:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1979 ms
[2024-05-29 13:11:56] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 3 ms to minimize.
[2024-05-29 13:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-29 13:11:57] [INFO ] After 3059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 316 ms.
[2024-05-29 13:11:57] [INFO ] After 4398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA ShieldPPPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 640 stabilizing places and 640 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 3 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2682 transition count 2402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2682 transition count 2402
Applied a total of 24 rules in 371 ms. Remains 2682 /2694 variables (removed 12) and now considering 2402/2414 (removed 12) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 13:11:58] [INFO ] Computed 441 invariants in 9 ms
[2024-05-29 13:11:59] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2024-05-29 13:11:59] [INFO ] Invariant cache hit.
[2024-05-29 13:12:02] [INFO ] Implicit Places using invariants and state equation in 2594 ms returned []
Implicit Place search using SMT with State Equation took 3779 ms to find 0 implicit places.
[2024-05-29 13:12:02] [INFO ] Invariant cache hit.
[2024-05-29 13:12:03] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2694 places, 2402/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5957 ms. Remains : 2682/2694 places, 2402/2414 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s508 0), p1:(AND (EQ s1281 0) (EQ s1268 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1562 ms.
Product exploration explored 100000 steps with 50000 reset in 1462 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2682 stabilizing places and 638/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLFireability-01 finished in 9367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2683 transition count 2403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2683 transition count 2403
Applied a total of 22 rules in 384 ms. Remains 2683 /2694 variables (removed 11) and now considering 2403/2414 (removed 11) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2024-05-29 13:12:07] [INFO ] Computed 441 invariants in 14 ms
[2024-05-29 13:12:08] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2024-05-29 13:12:08] [INFO ] Invariant cache hit.
[2024-05-29 13:12:11] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
[2024-05-29 13:12:11] [INFO ] Invariant cache hit.
[2024-05-29 13:12:13] [INFO ] Dead Transitions using invariants and state equation in 1944 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2683/2694 places, 2403/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6151 ms. Remains : 2683/2694 places, 2403/2414 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s953 1), p0:(EQ s1604 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-02 finished in 6368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X(G(p0))))))))'
Support contains 1 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2681 transition count 2401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2681 transition count 2401
Applied a total of 26 rules in 370 ms. Remains 2681 /2694 variables (removed 13) and now considering 2401/2414 (removed 13) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2024-05-29 13:12:13] [INFO ] Computed 441 invariants in 16 ms
[2024-05-29 13:12:15] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2024-05-29 13:12:15] [INFO ] Invariant cache hit.
[2024-05-29 13:12:17] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 3965 ms to find 0 implicit places.
[2024-05-29 13:12:17] [INFO ] Invariant cache hit.
[2024-05-29 13:12:19] [INFO ] Dead Transitions using invariants and state equation in 1728 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2694 places, 2401/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6065 ms. Remains : 2681/2694 places, 2401/2414 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s2654 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-04 finished in 6249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((F(p1)&&F(p2))))))))'
Support contains 3 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2683 transition count 2403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2683 transition count 2403
Applied a total of 22 rules in 369 ms. Remains 2683 /2694 variables (removed 11) and now considering 2403/2414 (removed 11) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2024-05-29 13:12:20] [INFO ] Computed 441 invariants in 14 ms
[2024-05-29 13:12:21] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-05-29 13:12:21] [INFO ] Invariant cache hit.
[2024-05-29 13:12:24] [INFO ] Implicit Places using invariants and state equation in 2792 ms returned []
Implicit Place search using SMT with State Equation took 3890 ms to find 0 implicit places.
[2024-05-29 13:12:24] [INFO ] Invariant cache hit.
[2024-05-29 13:12:25] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2683/2694 places, 2403/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6149 ms. Remains : 2683/2694 places, 2403/2414 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s16 1), p1:(EQ s1538 1), p2:(EQ s1621 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 436 reset in 428 ms.
Product exploration explored 100000 steps with 436 reset in 554 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2683 stabilizing places and 638/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 246 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-05-29 13:12:28] [INFO ] Invariant cache hit.
[2024-05-29 13:12:30] [INFO ] [Real]Absence check using 441 positive place invariants in 647 ms returned sat
[2024-05-29 13:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:12:43] [INFO ] [Real]Absence check using state equation in 12633 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 13:12:43] [INFO ] Invariant cache hit.
[2024-05-29 13:12:46] [INFO ] [Real]Absence check using 441 positive place invariants in 1277 ms returned sat
[2024-05-29 13:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:12:58] [INFO ] [Real]Absence check using state equation in 12067 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Applied a total of 0 rules in 169 ms. Remains 2683 /2683 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 13:12:58] [INFO ] Invariant cache hit.
[2024-05-29 13:12:59] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-29 13:12:59] [INFO ] Invariant cache hit.
[2024-05-29 13:13:02] [INFO ] Implicit Places using invariants and state equation in 2960 ms returned []
Implicit Place search using SMT with State Equation took 3965 ms to find 0 implicit places.
[2024-05-29 13:13:02] [INFO ] Invariant cache hit.
[2024-05-29 13:13:04] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5960 ms. Remains : 2683/2683 places, 2403/2403 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2683 stabilizing places and 638/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 236 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2024-05-29 13:13:05] [INFO ] Invariant cache hit.
[2024-05-29 13:13:07] [INFO ] [Real]Absence check using 441 positive place invariants in 585 ms returned sat
[2024-05-29 13:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:13:20] [INFO ] [Real]Absence check using state equation in 12811 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 13:13:20] [INFO ] Invariant cache hit.
[2024-05-29 13:13:23] [INFO ] [Real]Absence check using 441 positive place invariants in 1308 ms returned sat
[2024-05-29 13:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:13:35] [INFO ] [Real]Absence check using state equation in 12042 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 432 reset in 372 ms.
Product exploration explored 100000 steps with 433 reset in 414 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Performed 559 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2683 transition count 2403
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 559 place count 2683 transition count 2564
Deduced a syphon composed of 759 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 759 place count 2683 transition count 2564
Performed 760 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1519 places in 4 ms
Iterating global reduction 1 with 760 rules applied. Total rules applied 1519 place count 2683 transition count 2565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1520 place count 2683 transition count 2564
Renaming transitions due to excessive name length > 1024 char.
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 1803 place count 2400 transition count 2280
Deduced a syphon composed of 1236 places in 4 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 2086 place count 2400 transition count 2280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1237 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2087 place count 2400 transition count 2280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2089 place count 2398 transition count 2278
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2091 place count 2398 transition count 2278
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -429
Deduced a syphon composed of 1336 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2192 place count 2398 transition count 2707
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2294 place count 2296 transition count 2503
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2396 place count 2296 transition count 2503
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -243
Deduced a syphon composed of 1291 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2453 place count 2296 transition count 2746
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2510 place count 2239 transition count 2632
Deduced a syphon composed of 1234 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2567 place count 2239 transition count 2632
Deduced a syphon composed of 1234 places in 2 ms
Applied a total of 2567 rules in 1773 ms. Remains 2239 /2683 variables (removed 444) and now considering 2632/2403 (removed -229) transitions.
[2024-05-29 13:13:38] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2632 rows 2239 cols
[2024-05-29 13:13:38] [INFO ] Computed 441 invariants in 15 ms
[2024-05-29 13:13:40] [INFO ] Dead Transitions using invariants and state equation in 1704 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2239/2683 places, 2632/2403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3595 ms. Remains : 2239/2683 places, 2632/2403 transitions.
Built C files in :
/tmp/ltsmin17503709103312436305
[2024-05-29 13:13:40] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17503709103312436305
Running compilation step : cd /tmp/ltsmin17503709103312436305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17503709103312436305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17503709103312436305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Applied a total of 0 rules in 159 ms. Remains 2683 /2683 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2024-05-29 13:13:43] [INFO ] Computed 441 invariants in 11 ms
[2024-05-29 13:13:44] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-05-29 13:13:44] [INFO ] Invariant cache hit.
[2024-05-29 13:13:47] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 3775 ms to find 0 implicit places.
[2024-05-29 13:13:47] [INFO ] Invariant cache hit.
[2024-05-29 13:13:49] [INFO ] Dead Transitions using invariants and state equation in 1895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5830 ms. Remains : 2683/2683 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin6526541696350444280
[2024-05-29 13:13:49] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6526541696350444280
Running compilation step : cd /tmp/ltsmin6526541696350444280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6526541696350444280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6526541696350444280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 13:13:52] [INFO ] Flatten gal took : 70 ms
[2024-05-29 13:13:52] [INFO ] Flatten gal took : 68 ms
[2024-05-29 13:13:52] [INFO ] Time to serialize gal into /tmp/LTL7278441539585878415.gal : 16 ms
[2024-05-29 13:13:52] [INFO ] Time to serialize properties into /tmp/LTL18402554088503931607.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7278441539585878415.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2213196367705011047.hoa' '-atoms' '/tmp/LTL18402554088503931607.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18402554088503931607.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2213196367705011047.hoa
Detected timeout of ITS tools.
[2024-05-29 13:14:08] [INFO ] Flatten gal took : 64 ms
[2024-05-29 13:14:08] [INFO ] Flatten gal took : 75 ms
[2024-05-29 13:14:08] [INFO ] Time to serialize gal into /tmp/LTL7642191607275036899.gal : 10 ms
[2024-05-29 13:14:08] [INFO ] Time to serialize properties into /tmp/LTL10269983363580548359.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7642191607275036899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10269983363580548359.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p16==1)")||(G((F("(p1783==1)"))&&(F("(p1881==1)")))))))))
Formula 0 simplified : XXG(!"(p16==1)" & F(G!"(p1783==1)" | G!"(p1881==1)"))
Detected timeout of ITS tools.
[2024-05-29 13:14:23] [INFO ] Flatten gal took : 73 ms
[2024-05-29 13:14:23] [INFO ] Applying decomposition
[2024-05-29 13:14:23] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3012649881499574245.txt' '-o' '/tmp/graph3012649881499574245.bin' '-w' '/tmp/graph3012649881499574245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3012649881499574245.bin' '-l' '-1' '-v' '-w' '/tmp/graph3012649881499574245.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:14:23] [INFO ] Decomposing Gal with order
[2024-05-29 13:14:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:14:24] [INFO ] Removed a total of 398 redundant transitions.
[2024-05-29 13:14:24] [INFO ] Flatten gal took : 172 ms
[2024-05-29 13:14:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 13:14:24] [INFO ] Time to serialize gal into /tmp/LTL1612827580438360580.gal : 25 ms
[2024-05-29 13:14:24] [INFO ] Time to serialize properties into /tmp/LTL4412747077609958383.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1612827580438360580.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4412747077609958383.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i23.i0.i0.u6.p16==1)")||(G((F("(i22.u550.p1783==1)"))&&(F("(i23.i0.i1.u582.p1881==1)")))))))))
Formula 0 simplified : XXG(!"(i23.i0.i0.u6.p16==1)" & F(G!"(i22.u550.p1783==1)" | G!"(i23.i0.i1.u582.p1881==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5173050112458415516
[2024-05-29 13:14:39] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5173050112458415516
Running compilation step : cd /tmp/ltsmin5173050112458415516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5173050112458415516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5173050112458415516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-040B-LTLFireability-05 finished in 142555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1 U X(p2))))))'
Support contains 3 out of 2694 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2693 transition count 1853
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2133 transition count 1853
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 1120 place count 2133 transition count 1541
Deduced a syphon composed of 312 places in 3 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1744 place count 1821 transition count 1541
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1753 place count 1812 transition count 1532
Iterating global reduction 2 with 9 rules applied. Total rules applied 1762 place count 1812 transition count 1532
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1762 place count 1812 transition count 1525
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1776 place count 1805 transition count 1525
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 6 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 3136 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3137 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3139 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3341 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3377 place count 1005 transition count 843
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3379 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3380 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3380 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3384 place count 1000 transition count 839
Applied a total of 3384 rules in 476 ms. Remains 1000 /2694 variables (removed 1694) and now considering 839/2414 (removed 1575) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2024-05-29 13:14:42] [INFO ] Computed 440 invariants in 13 ms
[2024-05-29 13:14:43] [INFO ] Implicit Places using invariants in 736 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 738 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2694 places, 839/2414 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 837
Applied a total of 4 rules in 33 ms. Remains 996 /998 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 996 cols
[2024-05-29 13:14:43] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:14:44] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 13:14:44] [INFO ] Invariant cache hit.
[2024-05-29 13:14:45] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2694 places, 837/2414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2983 ms. Remains : 996/2694 places, 837/2414 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s53 0) (EQ s74 0)) (EQ s379 0)), p2:(AND (EQ s53 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 730 ms.
Product exploration explored 100000 steps with 0 reset in 1036 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 169549 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169549 steps, saw 124215 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 13:14:50] [INFO ] Invariant cache hit.
[2024-05-29 13:14:51] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:14:51] [INFO ] [Nat]Absence check using 438 positive place invariants in 75 ms returned sat
[2024-05-29 13:14:51] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:14:51] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-29 13:14:51] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 996/996 places, 837/837 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 996 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 995 transition count 836
Applied a total of 2 rules in 40 ms. Remains 995 /996 variables (removed 1) and now considering 836/837 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 995/996 places, 836/837 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 134082 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134082 steps, saw 97771 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 836 rows 995 cols
[2024-05-29 13:14:55] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:14:55] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:14:55] [INFO ] [Nat]Absence check using 438 positive place invariants in 74 ms returned sat
[2024-05-29 13:14:56] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:14:56] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-29 13:14:56] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 836/836 transitions.
Applied a total of 0 rules in 19 ms. Remains 995 /995 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 995/995 places, 836/836 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 836/836 transitions.
Applied a total of 0 rules in 18 ms. Remains 995 /995 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2024-05-29 13:14:56] [INFO ] Invariant cache hit.
[2024-05-29 13:14:56] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-29 13:14:56] [INFO ] Invariant cache hit.
[2024-05-29 13:14:57] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2024-05-29 13:14:58] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 13:14:58] [INFO ] Invariant cache hit.
[2024-05-29 13:14:58] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2108 ms. Remains : 995/995 places, 836/836 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 995 transition count 836
Applied a total of 235 rules in 41 ms. Remains 995 /995 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 836 rows 995 cols
[2024-05-29 13:14:58] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:14:58] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:14:58] [INFO ] [Nat]Absence check using 438 positive place invariants in 69 ms returned sat
[2024-05-29 13:14:59] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:14:59] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-29 13:14:59] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 996 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 837/837 transitions.
Applied a total of 0 rules in 22 ms. Remains 996 /996 variables (removed 0) and now considering 837/837 (removed 0) transitions.
// Phase 1: matrix 837 rows 996 cols
[2024-05-29 13:14:59] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:15:00] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-29 13:15:00] [INFO ] Invariant cache hit.
[2024-05-29 13:15:01] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2024-05-29 13:15:01] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 13:15:01] [INFO ] Invariant cache hit.
[2024-05-29 13:15:02] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2244 ms. Remains : 996/996 places, 837/837 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 132366 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132366 steps, saw 96658 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 13:15:05] [INFO ] Invariant cache hit.
[2024-05-29 13:15:05] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:15:05] [INFO ] [Nat]Absence check using 438 positive place invariants in 72 ms returned sat
[2024-05-29 13:15:06] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:15:06] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 13:15:06] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 996/996 places, 837/837 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 996 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 995 transition count 836
Applied a total of 2 rules in 25 ms. Remains 995 /996 variables (removed 1) and now considering 836/837 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 995/996 places, 836/837 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 147389 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147389 steps, saw 107422 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 836 rows 995 cols
[2024-05-29 13:15:09] [INFO ] Computed 438 invariants in 6 ms
[2024-05-29 13:15:10] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:15:10] [INFO ] [Nat]Absence check using 438 positive place invariants in 83 ms returned sat
[2024-05-29 13:15:10] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:15:10] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-29 13:15:10] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 836/836 transitions.
Applied a total of 0 rules in 34 ms. Remains 995 /995 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 995/995 places, 836/836 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 836/836 transitions.
Applied a total of 0 rules in 21 ms. Remains 995 /995 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2024-05-29 13:15:11] [INFO ] Invariant cache hit.
[2024-05-29 13:15:11] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-29 13:15:11] [INFO ] Invariant cache hit.
[2024-05-29 13:15:12] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2024-05-29 13:15:12] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 13:15:12] [INFO ] Invariant cache hit.
[2024-05-29 13:15:13] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2251 ms. Remains : 995/995 places, 836/836 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 995 transition count 836
Applied a total of 235 rules in 37 ms. Remains 995 /995 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 836 rows 995 cols
[2024-05-29 13:15:13] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:15:13] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:15:13] [INFO ] [Nat]Absence check using 438 positive place invariants in 71 ms returned sat
[2024-05-29 13:15:14] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:15:14] [INFO ] After 520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 13:15:14] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 708 ms.
Product exploration explored 100000 steps with 0 reset in 1057 ms.
Built C files in :
/tmp/ltsmin1611202519353415841
[2024-05-29 13:15:16] [INFO ] Computing symmetric may disable matrix : 837 transitions.
[2024-05-29 13:15:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:16] [INFO ] Computing symmetric may enable matrix : 837 transitions.
[2024-05-29 13:15:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:16] [INFO ] Computing Do-Not-Accords matrix : 837 transitions.
[2024-05-29 13:15:16] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:16] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1611202519353415841
Running compilation step : cd /tmp/ltsmin1611202519353415841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2295 ms.
Running link step : cd /tmp/ltsmin1611202519353415841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin1611202519353415841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11447122935141908036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 837/837 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 996 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 995 transition count 836
Applied a total of 2 rules in 40 ms. Remains 995 /996 variables (removed 1) and now considering 836/837 (removed 1) transitions.
// Phase 1: matrix 836 rows 995 cols
[2024-05-29 13:15:31] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:15:32] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-29 13:15:32] [INFO ] Invariant cache hit.
[2024-05-29 13:15:33] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
[2024-05-29 13:15:33] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 13:15:33] [INFO ] Invariant cache hit.
[2024-05-29 13:15:33] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/996 places, 836/837 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2248 ms. Remains : 995/996 places, 836/837 transitions.
Built C files in :
/tmp/ltsmin12494392247547504586
[2024-05-29 13:15:33] [INFO ] Computing symmetric may disable matrix : 836 transitions.
[2024-05-29 13:15:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:33] [INFO ] Computing symmetric may enable matrix : 836 transitions.
[2024-05-29 13:15:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:33] [INFO ] Computing Do-Not-Accords matrix : 836 transitions.
[2024-05-29 13:15:33] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:33] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12494392247547504586
Running compilation step : cd /tmp/ltsmin12494392247547504586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2273 ms.
Running link step : cd /tmp/ltsmin12494392247547504586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12494392247547504586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13843100218728738836.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:15:48] [INFO ] Flatten gal took : 24 ms
[2024-05-29 13:15:48] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:15:48] [INFO ] Time to serialize gal into /tmp/LTL744196285804731796.gal : 4 ms
[2024-05-29 13:15:48] [INFO ] Time to serialize properties into /tmp/LTL16097380183126346408.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL744196285804731796.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10326624884633269447.hoa' '-atoms' '/tmp/LTL16097380183126346408.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16097380183126346408.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10326624884633269447.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.79862e+65 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1091 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.0073,328504,1,0,11,2.24085e+06,34,10,24565,451187,32
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-040B-LTLFireability-06 finished in 78810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(p1||G(F(p2))))))'
Support contains 2 out of 2694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2693 transition count 1855
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2135 transition count 1855
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 1116 place count 2135 transition count 1542
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1742 place count 1822 transition count 1542
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1751 place count 1813 transition count 1533
Iterating global reduction 2 with 9 rules applied. Total rules applied 1760 place count 1813 transition count 1533
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1760 place count 1813 transition count 1525
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1776 place count 1805 transition count 1525
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 3136 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3137 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3139 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3341 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3377 place count 1005 transition count 843
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3379 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3380 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3380 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3384 place count 1000 transition count 839
Applied a total of 3384 rules in 433 ms. Remains 1000 /2694 variables (removed 1694) and now considering 839/2414 (removed 1575) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2024-05-29 13:16:01] [INFO ] Computed 440 invariants in 4 ms
[2024-05-29 13:16:02] [INFO ] Implicit Places using invariants in 606 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 608 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2694 places, 839/2414 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 837
Applied a total of 4 rules in 36 ms. Remains 996 /998 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 996 cols
[2024-05-29 13:16:02] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:16:02] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-29 13:16:02] [INFO ] Invariant cache hit.
[2024-05-29 13:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:16:03] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2694 places, 837/2414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2804 ms. Remains : 996/2694 places, 837/2414 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s725 1), p1:(EQ s725 0), p2:(EQ s605 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 669 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-07 finished in 3780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)||X(F(p0)))))'
Support contains 2 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2681 transition count 2401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2681 transition count 2401
Applied a total of 26 rules in 295 ms. Remains 2681 /2694 variables (removed 13) and now considering 2401/2414 (removed 13) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2024-05-29 13:16:05] [INFO ] Computed 441 invariants in 11 ms
[2024-05-29 13:16:06] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-29 13:16:06] [INFO ] Invariant cache hit.
[2024-05-29 13:16:09] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
[2024-05-29 13:16:09] [INFO ] Invariant cache hit.
[2024-05-29 13:16:10] [INFO ] Dead Transitions using invariants and state equation in 1770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2694 places, 2401/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5839 ms. Remains : 2681/2694 places, 2401/2414 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1497 1), p0:(EQ s2619 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9573 reset in 481 ms.
Product exploration explored 100000 steps with 9470 reset in 504 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 169 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 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-29 13:16:12] [INFO ] Invariant cache hit.
[2024-05-29 13:16:14] [INFO ] [Real]Absence check using 441 positive place invariants in 818 ms returned sat
[2024-05-29 13:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:16:27] [INFO ] [Real]Absence check using state equation in 12608 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2680 transition count 1842
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2122 transition count 1842
Performed 322 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 322 Pre rules applied. Total rules applied 1116 place count 2122 transition count 1520
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 2 with 644 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 2 with 1350 rules applied. Total rules applied 3110 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3111 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3113 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3315 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3351 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3352 place count 1004 transition count 842
Applied a total of 3352 rules in 448 ms. Remains 1004 /2681 variables (removed 1677) and now considering 842/2401 (removed 1559) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2024-05-29 13:16:27] [INFO ] Computed 441 invariants in 1 ms
[2024-05-29 13:16:28] [INFO ] Implicit Places using invariants in 779 ms returned [997]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 781 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2681 places, 842/2401 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 840
Applied a total of 4 rules in 22 ms. Remains 1001 /1003 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2024-05-29 13:16:28] [INFO ] Computed 440 invariants in 11 ms
[2024-05-29 13:16:29] [INFO ] Implicit Places using invariants in 648 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 655 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/2681 places, 840/2401 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 838
Applied a total of 4 rules in 31 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2024-05-29 13:16:29] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:16:29] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-29 13:16:29] [INFO ] Invariant cache hit.
[2024-05-29 13:16:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 13:16:31] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 997/2681 places, 838/2401 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3820 ms. Remains : 997/2681 places, 838/2401 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/997 stabilizing places and 4/838 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 48 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLFireability-08 finished in 26330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(X(p0)) U p1))&&F(p2)))'
Support contains 3 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2682 transition count 2402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2682 transition count 2402
Applied a total of 24 rules in 296 ms. Remains 2682 /2694 variables (removed 12) and now considering 2402/2414 (removed 12) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 13:16:31] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 13:16:32] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-05-29 13:16:32] [INFO ] Invariant cache hit.
[2024-05-29 13:16:35] [INFO ] Implicit Places using invariants and state equation in 2736 ms returned []
Implicit Place search using SMT with State Equation took 3887 ms to find 0 implicit places.
[2024-05-29 13:16:35] [INFO ] Invariant cache hit.
[2024-05-29 13:16:37] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2694 places, 2402/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5889 ms. Remains : 2682/2694 places, 2402/2414 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (OR (EQ s2153 1) (EQ s2388 1)) (EQ s195 1)), p1:(AND (EQ s2153 1) (EQ s195 1)), p0:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 668 ms.
Stack based approach found an accepted trace after 2214 steps with 0 reset with depth 2215 and stack size 2215 in 18 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-10 finished in 6818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2682 transition count 2402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2682 transition count 2402
Applied a total of 24 rules in 273 ms. Remains 2682 /2694 variables (removed 12) and now considering 2402/2414 (removed 12) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 13:16:38] [INFO ] Computed 441 invariants in 15 ms
[2024-05-29 13:16:39] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-29 13:16:39] [INFO ] Invariant cache hit.
[2024-05-29 13:16:42] [INFO ] Implicit Places using invariants and state equation in 2690 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2024-05-29 13:16:42] [INFO ] Invariant cache hit.
[2024-05-29 13:16:43] [INFO ] Dead Transitions using invariants and state equation in 1721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2694 places, 2402/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5740 ms. Remains : 2682/2694 places, 2402/2414 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1990 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4 reset in 669 ms.
Stack based approach found an accepted trace after 3683 steps with 0 reset with depth 3684 and stack size 3684 in 32 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-12 finished in 6556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&G(!p1)))))))'
Support contains 3 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2683 transition count 2403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2683 transition count 2403
Applied a total of 22 rules in 273 ms. Remains 2683 /2694 variables (removed 11) and now considering 2403/2414 (removed 11) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2024-05-29 13:16:44] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 13:16:45] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-29 13:16:45] [INFO ] Invariant cache hit.
[2024-05-29 13:16:48] [INFO ] Implicit Places using invariants and state equation in 2750 ms returned []
Implicit Place search using SMT with State Equation took 3801 ms to find 0 implicit places.
[2024-05-29 13:16:48] [INFO ] Invariant cache hit.
[2024-05-29 13:16:50] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2683/2694 places, 2403/2414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5903 ms. Remains : 2683/2694 places, 2403/2414 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s835 1) (EQ s2405 1)), p0:(NEQ s2555 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 690 ms.
Product exploration explored 100000 steps with 0 reset in 940 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2683 stabilizing places and 639/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 147 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 13:16:52] [INFO ] Invariant cache hit.
[2024-05-29 13:16:53] [INFO ] [Real]Absence check using 441 positive place invariants in 155 ms returned sat
[2024-05-29 13:16:54] [INFO ] After 1222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 21 places in 659 ms of which 3 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 34 places in 677 ms of which 1 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 23 places in 666 ms of which 2 ms to minimize.
[2024-05-29 13:16:57] [INFO ] Deduced a trap composed of 30 places in 658 ms of which 2 ms to minimize.
[2024-05-29 13:16:58] [INFO ] Deduced a trap composed of 23 places in 638 ms of which 3 ms to minimize.
[2024-05-29 13:16:59] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 3 ms to minimize.
[2024-05-29 13:16:59] [INFO ] Deduced a trap composed of 29 places in 610 ms of which 2 ms to minimize.
[2024-05-29 13:17:00] [INFO ] Deduced a trap composed of 46 places in 555 ms of which 2 ms to minimize.
[2024-05-29 13:17:01] [INFO ] Deduced a trap composed of 37 places in 603 ms of which 1 ms to minimize.
[2024-05-29 13:17:01] [INFO ] Deduced a trap composed of 51 places in 584 ms of which 1 ms to minimize.
[2024-05-29 13:17:02] [INFO ] Deduced a trap composed of 44 places in 566 ms of which 2 ms to minimize.
[2024-05-29 13:17:03] [INFO ] Deduced a trap composed of 26 places in 550 ms of which 2 ms to minimize.
[2024-05-29 13:17:03] [INFO ] Deduced a trap composed of 53 places in 529 ms of which 2 ms to minimize.
[2024-05-29 13:17:04] [INFO ] Deduced a trap composed of 36 places in 548 ms of which 1 ms to minimize.
[2024-05-29 13:17:05] [INFO ] Deduced a trap composed of 51 places in 515 ms of which 1 ms to minimize.
[2024-05-29 13:17:05] [INFO ] Deduced a trap composed of 24 places in 513 ms of which 1 ms to minimize.
[2024-05-29 13:17:06] [INFO ] Deduced a trap composed of 28 places in 509 ms of which 1 ms to minimize.
[2024-05-29 13:17:06] [INFO ] Deduced a trap composed of 33 places in 512 ms of which 1 ms to minimize.
[2024-05-29 13:17:07] [INFO ] Deduced a trap composed of 26 places in 506 ms of which 1 ms to minimize.
[2024-05-29 13:17:08] [INFO ] Deduced a trap composed of 24 places in 496 ms of which 1 ms to minimize.
[2024-05-29 13:17:08] [INFO ] Deduced a trap composed of 32 places in 476 ms of which 1 ms to minimize.
[2024-05-29 13:17:09] [INFO ] Deduced a trap composed of 24 places in 490 ms of which 1 ms to minimize.
[2024-05-29 13:17:09] [INFO ] Deduced a trap composed of 34 places in 480 ms of which 1 ms to minimize.
[2024-05-29 13:17:10] [INFO ] Deduced a trap composed of 42 places in 456 ms of which 1 ms to minimize.
[2024-05-29 13:17:10] [INFO ] Deduced a trap composed of 35 places in 431 ms of which 1 ms to minimize.
[2024-05-29 13:17:11] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 1 ms to minimize.
[2024-05-29 13:17:11] [INFO ] Deduced a trap composed of 46 places in 436 ms of which 1 ms to minimize.
[2024-05-29 13:17:12] [INFO ] Deduced a trap composed of 30 places in 441 ms of which 1 ms to minimize.
[2024-05-29 13:17:12] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 1 ms to minimize.
[2024-05-29 13:17:13] [INFO ] Deduced a trap composed of 28 places in 440 ms of which 3 ms to minimize.
[2024-05-29 13:17:13] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 1 ms to minimize.
[2024-05-29 13:17:14] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 1 ms to minimize.
[2024-05-29 13:17:14] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 1 ms to minimize.
[2024-05-29 13:17:15] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 1 ms to minimize.
[2024-05-29 13:17:15] [INFO ] Deduced a trap composed of 38 places in 412 ms of which 1 ms to minimize.
[2024-05-29 13:17:16] [INFO ] Deduced a trap composed of 26 places in 394 ms of which 1 ms to minimize.
[2024-05-29 13:17:16] [INFO ] Deduced a trap composed of 38 places in 377 ms of which 1 ms to minimize.
[2024-05-29 13:17:17] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 1 ms to minimize.
[2024-05-29 13:17:17] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 1 ms to minimize.
[2024-05-29 13:17:18] [INFO ] Deduced a trap composed of 40 places in 356 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 13:17:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:17:18] [INFO ] After 25275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2683 transition count 1844
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2124 transition count 1844
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1118 place count 2124 transition count 1525
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1756 place count 1805 transition count 1525
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3114 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3115 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3117 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3319 place count 1024 transition count 844
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3353 place count 1007 transition count 844
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3354 place count 1007 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3355 place count 1006 transition count 843
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3474 place count 1006 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3475 place count 1005 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3476 place count 1004 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3476 place count 1004 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3480 place count 1002 transition count 840
Applied a total of 3480 rules in 404 ms. Remains 1002 /2683 variables (removed 1681) and now considering 840/2403 (removed 1563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 1002/2683 places, 840/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 840 rows 1002 cols
[2024-05-29 13:17:18] [INFO ] Computed 440 invariants in 3 ms
[2024-05-29 13:17:19] [INFO ] [Real]Absence check using 440 positive place invariants in 76 ms returned sat
[2024-05-29 13:17:19] [INFO ] After 370ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:17:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 13:17:19] [INFO ] After 39ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:19] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:19] [INFO ] [Nat]Absence check using 440 positive place invariants in 69 ms returned sat
[2024-05-29 13:17:20] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:20] [INFO ] After 39ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:20] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 13:17:20] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1002 /1002 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1002/1002 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 218774 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218774 steps, saw 177745 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:17:23] [INFO ] Invariant cache hit.
[2024-05-29 13:17:23] [INFO ] [Real]Absence check using 440 positive place invariants in 67 ms returned sat
[2024-05-29 13:17:23] [INFO ] After 342ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:17:23] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 13:17:23] [INFO ] After 37ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:23] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:24] [INFO ] [Nat]Absence check using 440 positive place invariants in 65 ms returned sat
[2024-05-29 13:17:24] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:24] [INFO ] After 33ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:24] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 13:17:24] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1002 /1002 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1002/1002 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 840/840 transitions.
Applied a total of 0 rules in 36 ms. Remains 1002 /1002 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2024-05-29 13:17:24] [INFO ] Invariant cache hit.
[2024-05-29 13:17:25] [INFO ] Implicit Places using invariants in 631 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 634 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1002 places, 840/840 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 998 transition count 838
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 998 transition count 838
Applied a total of 4 rules in 30 ms. Remains 998 /1000 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:17:25] [INFO ] Computed 438 invariants in 1 ms
[2024-05-29 13:17:25] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-29 13:17:26] [INFO ] Invariant cache hit.
[2024-05-29 13:17:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:17:27] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 998/1002 places, 838/840 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2474 ms. Remains : 998/1002 places, 838/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224514 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224514 steps, saw 180845 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:17:30] [INFO ] Invariant cache hit.
[2024-05-29 13:17:30] [INFO ] [Real]Absence check using 438 positive place invariants in 63 ms returned sat
[2024-05-29 13:17:30] [INFO ] After 340ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:17:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:17:30] [INFO ] After 37ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:30] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:31] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2024-05-29 13:17:31] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:31] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:31] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 13:17:31] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 998/998 places, 838/838 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
[2024-05-29 13:17:31] [INFO ] Invariant cache hit.
[2024-05-29 13:17:32] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-29 13:17:32] [INFO ] Invariant cache hit.
[2024-05-29 13:17:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:17:33] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
[2024-05-29 13:17:33] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 13:17:33] [INFO ] Invariant cache hit.
[2024-05-29 13:17:34] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2470 ms. Remains : 998/998 places, 838/838 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 998 transition count 838
Applied a total of 235 rules in 35 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:17:34] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:17:34] [INFO ] [Real]Absence check using 438 positive place invariants in 76 ms returned sat
[2024-05-29 13:17:34] [INFO ] After 361ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:17:34] [INFO ] State equation strengthened by 233 read => feed constraints.
[2024-05-29 13:17:34] [INFO ] After 72ms SMT Verify possible using 233 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:34] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:17:34] [INFO ] [Nat]Absence check using 438 positive place invariants in 66 ms returned sat
[2024-05-29 13:17:35] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:35] [INFO ] After 91ms SMT Verify possible using 233 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:17:35] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2024-05-29 13:17:35] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2024-05-29 13:17:36] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2024-05-29 13:17:36] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2024-05-29 13:17:36] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2024-05-29 13:17:36] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2024-05-29 13:17:37] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-05-29 13:17:37] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2024-05-29 13:17:37] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2024-05-29 13:17:38] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2024-05-29 13:17:38] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2024-05-29 13:17:38] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2024-05-29 13:17:38] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2024-05-29 13:17:39] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2024-05-29 13:17:39] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3760 ms
[2024-05-29 13:17:39] [INFO ] After 3893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-29 13:17:39] [INFO ] After 4520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 314 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Applied a total of 0 rules in 131 ms. Remains 2683 /2683 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2024-05-29 13:17:39] [INFO ] Computed 441 invariants in 8 ms
[2024-05-29 13:17:40] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-05-29 13:17:40] [INFO ] Invariant cache hit.
[2024-05-29 13:17:43] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned []
Implicit Place search using SMT with State Equation took 3636 ms to find 0 implicit places.
[2024-05-29 13:17:43] [INFO ] Invariant cache hit.
[2024-05-29 13:17:45] [INFO ] Dead Transitions using invariants and state equation in 1741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5514 ms. Remains : 2683/2683 places, 2403/2403 transitions.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2683 stabilizing places and 639/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 185 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 13:17:45] [INFO ] Invariant cache hit.
[2024-05-29 13:17:46] [INFO ] [Real]Absence check using 441 positive place invariants in 160 ms returned sat
[2024-05-29 13:17:47] [INFO ] After 1311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 13:17:48] [INFO ] Deduced a trap composed of 21 places in 667 ms of which 2 ms to minimize.
[2024-05-29 13:17:49] [INFO ] Deduced a trap composed of 34 places in 616 ms of which 1 ms to minimize.
[2024-05-29 13:17:49] [INFO ] Deduced a trap composed of 23 places in 616 ms of which 1 ms to minimize.
[2024-05-29 13:17:50] [INFO ] Deduced a trap composed of 30 places in 605 ms of which 2 ms to minimize.
[2024-05-29 13:17:51] [INFO ] Deduced a trap composed of 23 places in 594 ms of which 1 ms to minimize.
[2024-05-29 13:17:51] [INFO ] Deduced a trap composed of 23 places in 583 ms of which 2 ms to minimize.
[2024-05-29 13:17:52] [INFO ] Deduced a trap composed of 29 places in 568 ms of which 1 ms to minimize.
[2024-05-29 13:17:53] [INFO ] Deduced a trap composed of 46 places in 544 ms of which 2 ms to minimize.
[2024-05-29 13:17:53] [INFO ] Deduced a trap composed of 37 places in 544 ms of which 2 ms to minimize.
[2024-05-29 13:17:54] [INFO ] Deduced a trap composed of 51 places in 542 ms of which 2 ms to minimize.
[2024-05-29 13:17:55] [INFO ] Deduced a trap composed of 44 places in 546 ms of which 1 ms to minimize.
[2024-05-29 13:17:55] [INFO ] Deduced a trap composed of 26 places in 546 ms of which 1 ms to minimize.
[2024-05-29 13:17:56] [INFO ] Deduced a trap composed of 53 places in 526 ms of which 1 ms to minimize.
[2024-05-29 13:17:56] [INFO ] Deduced a trap composed of 36 places in 537 ms of which 1 ms to minimize.
[2024-05-29 13:17:57] [INFO ] Deduced a trap composed of 51 places in 522 ms of which 1 ms to minimize.
[2024-05-29 13:17:58] [INFO ] Deduced a trap composed of 24 places in 524 ms of which 1 ms to minimize.
[2024-05-29 13:17:58] [INFO ] Deduced a trap composed of 28 places in 519 ms of which 1 ms to minimize.
[2024-05-29 13:17:59] [INFO ] Deduced a trap composed of 33 places in 566 ms of which 2 ms to minimize.
[2024-05-29 13:18:00] [INFO ] Deduced a trap composed of 26 places in 506 ms of which 1 ms to minimize.
[2024-05-29 13:18:00] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 1 ms to minimize.
[2024-05-29 13:18:01] [INFO ] Deduced a trap composed of 32 places in 487 ms of which 2 ms to minimize.
[2024-05-29 13:18:01] [INFO ] Deduced a trap composed of 24 places in 467 ms of which 1 ms to minimize.
[2024-05-29 13:18:02] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 2 ms to minimize.
[2024-05-29 13:18:02] [INFO ] Deduced a trap composed of 42 places in 452 ms of which 1 ms to minimize.
[2024-05-29 13:18:03] [INFO ] Deduced a trap composed of 35 places in 470 ms of which 1 ms to minimize.
[2024-05-29 13:18:03] [INFO ] Deduced a trap composed of 25 places in 443 ms of which 1 ms to minimize.
[2024-05-29 13:18:04] [INFO ] Deduced a trap composed of 46 places in 440 ms of which 1 ms to minimize.
[2024-05-29 13:18:04] [INFO ] Deduced a trap composed of 30 places in 450 ms of which 1 ms to minimize.
[2024-05-29 13:18:05] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 1 ms to minimize.
[2024-05-29 13:18:05] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2024-05-29 13:18:06] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 1 ms to minimize.
[2024-05-29 13:18:06] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 1 ms to minimize.
[2024-05-29 13:18:07] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 1 ms to minimize.
[2024-05-29 13:18:07] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 1 ms to minimize.
[2024-05-29 13:18:08] [INFO ] Deduced a trap composed of 38 places in 417 ms of which 1 ms to minimize.
[2024-05-29 13:18:08] [INFO ] Deduced a trap composed of 26 places in 413 ms of which 1 ms to minimize.
[2024-05-29 13:18:09] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 1 ms to minimize.
[2024-05-29 13:18:09] [INFO ] Deduced a trap composed of 39 places in 364 ms of which 1 ms to minimize.
[2024-05-29 13:18:10] [INFO ] Deduced a trap composed of 36 places in 371 ms of which 1 ms to minimize.
[2024-05-29 13:18:10] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 0 ms to minimize.
[2024-05-29 13:18:11] [INFO ] Deduced a trap composed of 41 places in 391 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 13:18:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:18:11] [INFO ] After 25404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2683 transition count 1844
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2124 transition count 1844
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1118 place count 2124 transition count 1525
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1756 place count 1805 transition count 1525
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3114 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3115 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3117 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3319 place count 1024 transition count 844
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3353 place count 1007 transition count 844
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3354 place count 1007 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3355 place count 1006 transition count 843
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3474 place count 1006 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3475 place count 1005 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3476 place count 1004 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3476 place count 1004 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3480 place count 1002 transition count 840
Applied a total of 3480 rules in 412 ms. Remains 1002 /2683 variables (removed 1681) and now considering 840/2403 (removed 1563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 1002/2683 places, 840/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 840 rows 1002 cols
[2024-05-29 13:18:11] [INFO ] Computed 440 invariants in 3 ms
[2024-05-29 13:18:12] [INFO ] [Real]Absence check using 440 positive place invariants in 66 ms returned sat
[2024-05-29 13:18:12] [INFO ] After 516ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:18:12] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 13:18:12] [INFO ] After 36ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:12] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:12] [INFO ] [Nat]Absence check using 440 positive place invariants in 65 ms returned sat
[2024-05-29 13:18:13] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:13] [INFO ] After 35ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:13] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-29 13:18:13] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1002 /1002 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1002/1002 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228883 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228883 steps, saw 185801 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:18:16] [INFO ] Invariant cache hit.
[2024-05-29 13:18:16] [INFO ] [Real]Absence check using 440 positive place invariants in 66 ms returned sat
[2024-05-29 13:18:17] [INFO ] After 340ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:18:17] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 13:18:17] [INFO ] After 36ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:17] [INFO ] After 611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:17] [INFO ] [Nat]Absence check using 440 positive place invariants in 66 ms returned sat
[2024-05-29 13:18:17] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:17] [INFO ] After 32ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:17] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 13:18:17] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 840/840 transitions.
Applied a total of 0 rules in 17 ms. Remains 1002 /1002 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1002/1002 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 1002 /1002 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2024-05-29 13:18:17] [INFO ] Invariant cache hit.
[2024-05-29 13:18:18] [INFO ] Implicit Places using invariants in 632 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 653 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1002 places, 840/840 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 998 transition count 838
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 998 transition count 838
Applied a total of 4 rules in 31 ms. Remains 998 /1000 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:18:18] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:18:19] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-29 13:18:19] [INFO ] Invariant cache hit.
[2024-05-29 13:18:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:18:20] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 998/1002 places, 838/840 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2538 ms. Remains : 998/1002 places, 838/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234330 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234330 steps, saw 188894 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:18:23] [INFO ] Invariant cache hit.
[2024-05-29 13:18:23] [INFO ] [Real]Absence check using 438 positive place invariants in 63 ms returned sat
[2024-05-29 13:18:24] [INFO ] After 338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:18:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:18:24] [INFO ] After 34ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:24] [INFO ] After 588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:24] [INFO ] [Nat]Absence check using 438 positive place invariants in 66 ms returned sat
[2024-05-29 13:18:24] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:24] [INFO ] After 39ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:24] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 13:18:24] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 998/998 places, 838/838 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 16 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
[2024-05-29 13:18:24] [INFO ] Invariant cache hit.
[2024-05-29 13:18:25] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-29 13:18:25] [INFO ] Invariant cache hit.
[2024-05-29 13:18:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:18:26] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2024-05-29 13:18:26] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 13:18:26] [INFO ] Invariant cache hit.
[2024-05-29 13:18:27] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2459 ms. Remains : 998/998 places, 838/838 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 998 transition count 838
Applied a total of 235 rules in 37 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:18:27] [INFO ] Computed 438 invariants in 1 ms
[2024-05-29 13:18:27] [INFO ] [Real]Absence check using 438 positive place invariants in 65 ms returned sat
[2024-05-29 13:18:27] [INFO ] After 361ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:18:27] [INFO ] State equation strengthened by 233 read => feed constraints.
[2024-05-29 13:18:28] [INFO ] After 74ms SMT Verify possible using 233 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:28] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:18:28] [INFO ] [Nat]Absence check using 438 positive place invariants in 65 ms returned sat
[2024-05-29 13:18:28] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:28] [INFO ] After 88ms SMT Verify possible using 233 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:18:28] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 13:18:29] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2024-05-29 13:18:29] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-05-29 13:18:29] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2024-05-29 13:18:30] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2024-05-29 13:18:30] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 13:18:30] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2024-05-29 13:18:30] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2024-05-29 13:18:31] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2024-05-29 13:18:31] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2024-05-29 13:18:31] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2024-05-29 13:18:31] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2024-05-29 13:18:32] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2024-05-29 13:18:32] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2024-05-29 13:18:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3903 ms
[2024-05-29 13:18:32] [INFO ] After 4033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 13:18:32] [INFO ] After 4646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 293 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 640 ms.
Product exploration explored 100000 steps with 0 reset in 841 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Performed 559 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2683 transition count 2403
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 559 place count 2683 transition count 2561
Deduced a syphon composed of 758 places in 3 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 758 place count 2683 transition count 2561
Performed 759 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1517 places in 5 ms
Iterating global reduction 1 with 759 rules applied. Total rules applied 1517 place count 2683 transition count 2561
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1518 place count 2683 transition count 2560
Renaming transitions due to excessive name length > 1024 char.
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 1800 place count 2401 transition count 2278
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 2082 place count 2401 transition count 2278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1236 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2083 place count 2401 transition count 2278
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2085 place count 2399 transition count 2276
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2087 place count 2399 transition count 2276
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1335 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2188 place count 2399 transition count 2704
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2289 place count 2298 transition count 2502
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2390 place count 2298 transition count 2502
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -240
Deduced a syphon composed of 1291 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2447 place count 2298 transition count 2742
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2504 place count 2241 transition count 2628
Deduced a syphon composed of 1234 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2561 place count 2241 transition count 2628
Deduced a syphon composed of 1234 places in 3 ms
Applied a total of 2561 rules in 945 ms. Remains 2241 /2683 variables (removed 442) and now considering 2628/2403 (removed -225) transitions.
[2024-05-29 13:18:35] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2628 rows 2241 cols
[2024-05-29 13:18:36] [INFO ] Computed 441 invariants in 24 ms
[2024-05-29 13:18:37] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2241/2683 places, 2628/2403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2655 ms. Remains : 2241/2683 places, 2628/2403 transitions.
Built C files in :
/tmp/ltsmin15944758115606268184
[2024-05-29 13:18:37] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15944758115606268184
Running compilation step : cd /tmp/ltsmin15944758115606268184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15944758115606268184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15944758115606268184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Applied a total of 0 rules in 139 ms. Remains 2683 /2683 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2024-05-29 13:18:40] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 13:18:41] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-05-29 13:18:41] [INFO ] Invariant cache hit.
[2024-05-29 13:18:44] [INFO ] Implicit Places using invariants and state equation in 2856 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
[2024-05-29 13:18:44] [INFO ] Invariant cache hit.
[2024-05-29 13:18:46] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5840 ms. Remains : 2683/2683 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin3478945914652471000
[2024-05-29 13:18:46] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3478945914652471000
Running compilation step : cd /tmp/ltsmin3478945914652471000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3478945914652471000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3478945914652471000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 13:18:49] [INFO ] Flatten gal took : 53 ms
[2024-05-29 13:18:49] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:18:49] [INFO ] Time to serialize gal into /tmp/LTL14525962409913458487.gal : 9 ms
[2024-05-29 13:18:49] [INFO ] Time to serialize properties into /tmp/LTL15592257459134315085.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14525962409913458487.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12687030684540651781.hoa' '-atoms' '/tmp/LTL15592257459134315085.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15592257459134315085.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12687030684540651781.hoa
Detected timeout of ITS tools.
[2024-05-29 13:19:04] [INFO ] Flatten gal took : 59 ms
[2024-05-29 13:19:04] [INFO ] Flatten gal took : 53 ms
[2024-05-29 13:19:04] [INFO ] Time to serialize gal into /tmp/LTL3785812651100026157.gal : 9 ms
[2024-05-29 13:19:04] [INFO ] Time to serialize properties into /tmp/LTL6813734096544739315.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3785812651100026157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6813734096544739315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p2971!=1)")U((G("(p2971!=1)"))||(("(p2971!=1)")&&(G(!("((p966==1)&&(p2794==1))")))))))))
Formula 0 simplified : XG(F"((p966==1)&&(p2794==1))" U !"(p2971!=1)")
Detected timeout of ITS tools.
[2024-05-29 13:19:20] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:19:20] [INFO ] Applying decomposition
[2024-05-29 13:19:20] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3608388720195125875.txt' '-o' '/tmp/graph3608388720195125875.bin' '-w' '/tmp/graph3608388720195125875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3608388720195125875.bin' '-l' '-1' '-v' '-w' '/tmp/graph3608388720195125875.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:19:20] [INFO ] Decomposing Gal with order
[2024-05-29 13:19:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:19:20] [INFO ] Removed a total of 399 redundant transitions.
[2024-05-29 13:19:20] [INFO ] Flatten gal took : 107 ms
[2024-05-29 13:19:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-29 13:19:20] [INFO ] Time to serialize gal into /tmp/LTL12142404801594908384.gal : 17 ms
[2024-05-29 13:19:20] [INFO ] Time to serialize properties into /tmp/LTL10803320032342600774.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12142404801594908384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10803320032342600774.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i38.u913.p2971!=1)")U((G("(i38.u913.p2971!=1)"))||(("(i38.u913.p2971!=1)")&&(G(!("((i11.i0.i3.u300.p966==1)&&(i35.u858.p2794...170
Formula 0 simplified : XG(F"((i11.i0.i3.u300.p966==1)&&(i35.u858.p2794==1))" U !"(i38.u913.p2971!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2673661620071031105
[2024-05-29 13:19:35] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2673661620071031105
Running compilation step : cd /tmp/ltsmin2673661620071031105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2673661620071031105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2673661620071031105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-040B-LTLFireability-13 finished in 174048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 2694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2693 transition count 1854
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2134 transition count 1854
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 1118 place count 2134 transition count 1541
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1744 place count 1821 transition count 1541
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1754 place count 1811 transition count 1531
Iterating global reduction 2 with 10 rules applied. Total rules applied 1764 place count 1811 transition count 1531
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1764 place count 1811 transition count 1523
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1780 place count 1803 transition count 1523
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3138 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3139 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3141 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3343 place count 1022 transition count 842
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3375 place count 1006 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3377 place count 1004 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3378 place count 1003 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3378 place count 1003 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3382 place count 1001 transition count 838
Applied a total of 3382 rules in 394 ms. Remains 1001 /2694 variables (removed 1693) and now considering 838/2414 (removed 1576) transitions.
// Phase 1: matrix 838 rows 1001 cols
[2024-05-29 13:19:39] [INFO ] Computed 440 invariants in 8 ms
[2024-05-29 13:19:39] [INFO ] Implicit Places using invariants in 636 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 637 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2694 places, 838/2414 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 836
Applied a total of 4 rules in 31 ms. Remains 997 /999 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 997 cols
[2024-05-29 13:19:39] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:19:40] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-29 13:19:40] [INFO ] Invariant cache hit.
[2024-05-29 13:19:41] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2694 places, 836/2414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2788 ms. Remains : 997/2694 places, 836/2414 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s851 1), p1:(EQ s547 1)], 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 2 reset in 598 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-15 finished in 3538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((F(p1)&&F(p2))))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-040B-LTLFireability-05
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2693 transition count 1852
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 1 with 561 rules applied. Total rules applied 1122 place count 2132 transition count 1852
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 1122 place count 2132 transition count 1540
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1746 place count 1820 transition count 1540
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1754 place count 1812 transition count 1532
Iterating global reduction 2 with 8 rules applied. Total rules applied 1762 place count 1812 transition count 1532
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1762 place count 1812 transition count 1525
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1776 place count 1805 transition count 1525
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3134 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3135 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3137 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3339 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3375 place count 1006 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3377 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3378 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3378 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3382 place count 1001 transition count 840
Applied a total of 3382 rules in 433 ms. Remains 1001 /2694 variables (removed 1693) and now considering 840/2414 (removed 1574) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2024-05-29 13:19:42] [INFO ] Computed 440 invariants in 5 ms
[2024-05-29 13:19:43] [INFO ] Implicit Places using invariants in 616 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 617 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 999/2694 places, 840/2414 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 838
Applied a total of 4 rules in 33 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2024-05-29 13:19:43] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:19:44] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-29 13:19:44] [INFO ] Invariant cache hit.
[2024-05-29 13:19:44] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-29 13:19:46] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3120 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 997/2694 places, 838/2414 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4205 ms. Remains : 997/2694 places, 838/2414 transitions.
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s573 1), p2:(EQ s603 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 668 ms.
Stack based approach found an accepted trace after 388 steps with 8 reset with depth 335 and stack size 335 in 4 ms.
Treatment of property ShieldPPPt-PT-040B-LTLFireability-05 finished in 5188 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&G(!p1)))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-040B-LTLFireability-13
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 3 out of 2694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2694/2694 places, 2414/2414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2693 transition count 1855
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2135 transition count 1855
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 1116 place count 2135 transition count 1541
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1744 place count 1821 transition count 1541
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1753 place count 1812 transition count 1532
Iterating global reduction 2 with 9 rules applied. Total rules applied 1762 place count 1812 transition count 1532
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1762 place count 1812 transition count 1525
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1776 place count 1805 transition count 1525
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 3132 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3133 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3135 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3337 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3371 place count 1008 transition count 845
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3373 place count 1006 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3374 place count 1005 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3374 place count 1005 transition count 841
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3378 place count 1003 transition count 841
Applied a total of 3378 rules in 422 ms. Remains 1003 /2694 variables (removed 1691) and now considering 841/2414 (removed 1573) transitions.
// Phase 1: matrix 841 rows 1003 cols
[2024-05-29 13:19:48] [INFO ] Computed 440 invariants in 2 ms
[2024-05-29 13:19:48] [INFO ] Implicit Places using invariants in 566 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 570 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1001/2694 places, 841/2414 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 999 transition count 839
Applied a total of 4 rules in 32 ms. Remains 999 /1001 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 999 cols
[2024-05-29 13:19:48] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:19:49] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-29 13:19:49] [INFO ] Invariant cache hit.
[2024-05-29 13:19:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:19:50] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 999/2694 places, 839/2414 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2832 ms. Remains : 999/2694 places, 839/2414 transitions.
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s303 1) (EQ s901 1)), p0:(NEQ s957 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 689 ms.
Product exploration explored 100000 steps with 0 reset in 976 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/999 stabilizing places and 4/839 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 352 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:19:52] [INFO ] Invariant cache hit.
[2024-05-29 13:19:53] [INFO ] [Real]Absence check using 438 positive place invariants in 69 ms returned sat
[2024-05-29 13:19:53] [INFO ] After 367ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:19:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:19:53] [INFO ] After 38ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:19:53] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:19:53] [INFO ] [Nat]Absence check using 438 positive place invariants in 69 ms returned sat
[2024-05-29 13:19:54] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:19:54] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:19:54] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-29 13:19:54] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 13:19:54] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 839/839 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 999 transition count 838
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 998 transition count 838
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 998 transition count 838
Applied a total of 5 rules in 51 ms. Remains 998 /999 variables (removed 1) and now considering 838/839 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 998/999 places, 838/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259719 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259719 steps, saw 197113 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:19:57] [INFO ] Computed 438 invariants in 5 ms
[2024-05-29 13:19:57] [INFO ] [Real]Absence check using 438 positive place invariants in 71 ms returned sat
[2024-05-29 13:19:58] [INFO ] After 351ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:19:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:19:58] [INFO ] After 42ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:19:58] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:19:58] [INFO ] [Nat]Absence check using 438 positive place invariants in 71 ms returned sat
[2024-05-29 13:19:58] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:19:58] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:19:58] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-29 13:19:58] [INFO ] After 728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 26 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 998/998 places, 838/838 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 18 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
[2024-05-29 13:19:58] [INFO ] Invariant cache hit.
[2024-05-29 13:19:59] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-29 13:19:59] [INFO ] Invariant cache hit.
[2024-05-29 13:20:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:20:00] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2024-05-29 13:20:00] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 13:20:00] [INFO ] Invariant cache hit.
[2024-05-29 13:20:01] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2358 ms. Remains : 998/998 places, 838/838 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 998 transition count 838
Applied a total of 235 rules in 38 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:20:01] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:20:01] [INFO ] [Real]Absence check using 438 positive place invariants in 74 ms returned sat
[2024-05-29 13:20:01] [INFO ] After 379ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:20:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 13:20:01] [INFO ] After 40ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:01] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:02] [INFO ] [Nat]Absence check using 438 positive place invariants in 71 ms returned sat
[2024-05-29 13:20:02] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:02] [INFO ] After 36ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:02] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 13:20:02] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 451 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 839/839 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 999 cols
[2024-05-29 13:20:03] [INFO ] Computed 438 invariants in 2 ms
[2024-05-29 13:20:04] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-29 13:20:04] [INFO ] Invariant cache hit.
[2024-05-29 13:20:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:20:05] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2024-05-29 13:20:05] [INFO ] Invariant cache hit.
[2024-05-29 13:20:05] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2317 ms. Remains : 999/999 places, 839/839 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/999 stabilizing places and 4/839 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:20:06] [INFO ] Invariant cache hit.
[2024-05-29 13:20:06] [INFO ] [Real]Absence check using 438 positive place invariants in 78 ms returned sat
[2024-05-29 13:20:07] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:20:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:20:07] [INFO ] After 39ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:07] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:07] [INFO ] [Nat]Absence check using 438 positive place invariants in 73 ms returned sat
[2024-05-29 13:20:07] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:07] [INFO ] After 44ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:07] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-29 13:20:07] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 13:20:07] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 839/839 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 999 transition count 838
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 998 transition count 838
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 998 transition count 838
Applied a total of 5 rules in 52 ms. Remains 998 /999 variables (removed 1) and now considering 838/839 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 998/999 places, 838/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253097 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253097 steps, saw 191987 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:20:11] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:20:11] [INFO ] [Real]Absence check using 438 positive place invariants in 75 ms returned sat
[2024-05-29 13:20:11] [INFO ] After 377ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:20:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:20:11] [INFO ] After 38ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:11] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:12] [INFO ] [Nat]Absence check using 438 positive place invariants in 81 ms returned sat
[2024-05-29 13:20:12] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:12] [INFO ] After 34ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:12] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 13:20:12] [INFO ] After 736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 998/998 places, 838/838 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 838/838 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
[2024-05-29 13:20:12] [INFO ] Invariant cache hit.
[2024-05-29 13:20:13] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-29 13:20:13] [INFO ] Invariant cache hit.
[2024-05-29 13:20:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:20:14] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2024-05-29 13:20:14] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 13:20:14] [INFO ] Invariant cache hit.
[2024-05-29 13:20:14] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2427 ms. Remains : 998/998 places, 838/838 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 998 transition count 838
Applied a total of 235 rules in 39 ms. Remains 998 /998 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 998 cols
[2024-05-29 13:20:15] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:20:15] [INFO ] [Real]Absence check using 438 positive place invariants in 73 ms returned sat
[2024-05-29 13:20:15] [INFO ] After 355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:20:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 13:20:15] [INFO ] After 35ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:15] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:20:15] [INFO ] [Nat]Absence check using 438 positive place invariants in 75 ms returned sat
[2024-05-29 13:20:16] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:16] [INFO ] After 35ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:20:16] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-29 13:20:16] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 445 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 676 ms.
Product exploration explored 100000 steps with 0 reset in 897 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 839/839 transitions.
Applied a total of 0 rules in 17 ms. Remains 999 /999 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2024-05-29 13:20:18] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 839 rows 999 cols
[2024-05-29 13:20:19] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:20:19] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 999/999 places, 839/839 transitions.
Built C files in :
/tmp/ltsmin18389190049052852223
[2024-05-29 13:20:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18389190049052852223
Running compilation step : cd /tmp/ltsmin18389190049052852223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1465 ms.
Running link step : cd /tmp/ltsmin18389190049052852223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18389190049052852223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6302951112799457154.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 839/839 transitions.
Applied a total of 0 rules in 19 ms. Remains 999 /999 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2024-05-29 13:20:34] [INFO ] Invariant cache hit.
[2024-05-29 13:20:35] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-29 13:20:35] [INFO ] Invariant cache hit.
[2024-05-29 13:20:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:20:36] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
[2024-05-29 13:20:36] [INFO ] Invariant cache hit.
[2024-05-29 13:20:37] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2364 ms. Remains : 999/999 places, 839/839 transitions.
Built C files in :
/tmp/ltsmin7501911682625496546
[2024-05-29 13:20:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7501911682625496546
Running compilation step : cd /tmp/ltsmin7501911682625496546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1459 ms.
Running link step : cd /tmp/ltsmin7501911682625496546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7501911682625496546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2645785393920740248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:20:52] [INFO ] Flatten gal took : 19 ms
[2024-05-29 13:20:52] [INFO ] Flatten gal took : 19 ms
[2024-05-29 13:20:52] [INFO ] Time to serialize gal into /tmp/LTL2180900095010987519.gal : 6 ms
[2024-05-29 13:20:52] [INFO ] Time to serialize properties into /tmp/LTL18009823717861133646.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2180900095010987519.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12053221044178104686.hoa' '-atoms' '/tmp/LTL18009823717861133646.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18009823717861133646.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12053221044178104686.hoa
Detected timeout of ITS tools.
[2024-05-29 13:21:07] [INFO ] Flatten gal took : 19 ms
[2024-05-29 13:21:07] [INFO ] Flatten gal took : 18 ms
[2024-05-29 13:21:07] [INFO ] Time to serialize gal into /tmp/LTL8022390265070410593.gal : 4 ms
[2024-05-29 13:21:07] [INFO ] Time to serialize properties into /tmp/LTL231138948463959874.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8022390265070410593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL231138948463959874.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p2971!=1)")U((G("(p2971!=1)"))||(("(p2971!=1)")&&(G(!("((p966==1)&&(p2794==1))")))))))))
Formula 0 simplified : XG(F"((p966==1)&&(p2794==1))" U !"(p2971!=1)")
Detected timeout of ITS tools.
[2024-05-29 13:21:22] [INFO ] Flatten gal took : 23 ms
[2024-05-29 13:21:22] [INFO ] Applying decomposition
[2024-05-29 13:21:22] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph8401934553900644581.txt' '-o' '/tmp/graph8401934553900644581.bin' '-w' '/tmp/graph8401934553900644581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8401934553900644581.bin' '-l' '-1' '-v' '-w' '/tmp/graph8401934553900644581.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:21:22] [INFO ] Decomposing Gal with order
[2024-05-29 13:21:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:21:22] [INFO ] Removed a total of 245 redundant transitions.
[2024-05-29 13:21:22] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 10 ms.
[2024-05-29 13:21:22] [INFO ] Time to serialize gal into /tmp/LTL11795391425459458413.gal : 11 ms
[2024-05-29 13:21:22] [INFO ] Time to serialize properties into /tmp/LTL14770632525584675256.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11795391425459458413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14770632525584675256.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i38.i0.i2.u306.p2971!=1)")U((G("(i38.i0.i2.u306.p2971!=1)"))||(("(i38.i0.i2.u306.p2971!=1)")&&(G(!("((i11.u97.p966==1)&&(i35...181
Formula 0 simplified : XG(F"((i11.u97.p966==1)&&(i35.u288.p2794==1))" U !"(i38.i0.i2.u306.p2971!=1)")
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.t1, i0.t0, i0.u1.t643, i1.t5, i1.t4, i1.t3, i1.u10.t648, i2.t8, i2.t7, i2.t6, i2.u1...1856
Computing Next relation with stutter on 6.79862e+65 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5732173584361840829
[2024-05-29 13:21:37] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5732173584361840829
Running compilation step : cd /tmp/ltsmin5732173584361840829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1479 ms.
Running link step : cd /tmp/ltsmin5732173584361840829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5732173584361840829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040B-LTLFireability-13 finished in 125340 ms.
[2024-05-29 13:21:52] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17088063336719068656
[2024-05-29 13:21:52] [INFO ] Too many transitions (2414) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:21:52] [INFO ] Applying decomposition
[2024-05-29 13:21:52] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17088063336719068656
Running compilation step : cd /tmp/ltsmin17088063336719068656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 13:21:52] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4471806558366665562.txt' '-o' '/tmp/graph4471806558366665562.bin' '-w' '/tmp/graph4471806558366665562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4471806558366665562.bin' '-l' '-1' '-v' '-w' '/tmp/graph4471806558366665562.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:21:53] [INFO ] Decomposing Gal with order
[2024-05-29 13:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:21:53] [INFO ] Removed a total of 388 redundant transitions.
[2024-05-29 13:21:53] [INFO ] Flatten gal took : 107 ms
[2024-05-29 13:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 13:21:53] [INFO ] Time to serialize gal into /tmp/LTLFireability6567627937728287366.gal : 23 ms
[2024-05-29 13:21:53] [INFO ] Time to serialize properties into /tmp/LTLFireability10782139805728242318.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6567627937728287366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10782139805728242318.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(F(("(i25.u581.p16==1)")||(G((F("(i22.u553.p1783==1)"))&&(F("(i23.u580.p1881==1)")))))))))
Formula 0 simplified : XXG(!"(i25.u581.p16==1)" & F(G!"(i22.u553.p1783==1)" | G!"(i23.u580.p1881==1)"))
Compilation finished in 5282 ms.
Running link step : cd /tmp/ltsmin17088063336719068656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17088063336719068656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp0==true)||[]((<>((LTLAPp1==true))&&<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 3954 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17088063336719068656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&[](!(LTLAPp4==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: LTL layer: formula: X(<>(((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&[](!(LTLAPp4==true)))))))
pins2lts-mc-linux64( 5/ 8), 0.031: "X(<>(((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&[](!(LTLAPp4==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.032: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.289: There are 2420 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.289: State length is 2695, there are 2427 groups
pins2lts-mc-linux64( 0/ 8), 1.289: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.289: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.289: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.289: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.594: [Blue] ~120 levels ~960 states ~8864 transitions
pins2lts-mc-linux64( 7/ 8), 1.910: [Blue] ~240 levels ~1920 states ~21848 transitions
pins2lts-mc-linux64( 7/ 8), 2.492: [Blue] ~480 levels ~3840 states ~44104 transitions
pins2lts-mc-linux64( 6/ 8), 3.469: [Blue] ~960 levels ~7680 states ~77512 transitions
pins2lts-mc-linux64( 7/ 8), 5.282: [Blue] ~1920 levels ~15360 states ~156728 transitions
pins2lts-mc-linux64( 4/ 8), 8.505: [Blue] ~3824 levels ~30720 states ~253104 transitions
pins2lts-mc-linux64( 1/ 8), 14.744: [Blue] ~7583 levels ~61440 states ~451160 transitions
pins2lts-mc-linux64( 1/ 8), 26.681: [Blue] ~15074 levels ~122880 states ~791464 transitions
pins2lts-mc-linux64( 1/ 8), 50.810: [Blue] ~30096 levels ~245760 states ~1440160 transitions
pins2lts-mc-linux64( 4/ 8), 104.714: [Blue] ~60728 levels ~491520 states ~2643024 transitions
pins2lts-mc-linux64( 4/ 8), 199.998: [Blue] ~121328 levels ~983040 states ~5343872 transitions
pins2lts-mc-linux64( 4/ 8), 389.819: [Blue] ~242328 levels ~1966080 states ~10904576 transitions
pins2lts-mc-linux64( 7/ 8), 623.448: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 623.722:
pins2lts-mc-linux64( 0/ 8), 623.722: Explored 3143059 states 22546228 transitions, fanout: 7.173
pins2lts-mc-linux64( 0/ 8), 623.722: Total exploration time 622.400 sec (622.180 sec minimum, 622.290 sec on average)
pins2lts-mc-linux64( 0/ 8), 623.722: States per second: 5050, Transitions per second: 36225
pins2lts-mc-linux64( 0/ 8), 623.722:
pins2lts-mc-linux64( 0/ 8), 623.722: State space has 15273120 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 623.722: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 623.722: blue states: 3143059 (20.58%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 623.722: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 623.722: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 623.722:
pins2lts-mc-linux64( 0/ 8), 623.722: Total memory used for local state coloring: 47.6MB
pins2lts-mc-linux64( 0/ 8), 623.722:
pins2lts-mc-linux64( 0/ 8), 623.722: Queue width: 8B, total height: 3118026, memory: 23.79MB
pins2lts-mc-linux64( 0/ 8), 623.722: Tree memory: 372.5MB, 25.6 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 623.722: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 623.722: Stored 2506 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 623.722: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 623.722: Est. total memory use: 396.3MB (~1047.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17088063336719068656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&[](!(LTLAPp4==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17088063336719068656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&[](!(LTLAPp4==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 13:45:37] [INFO ] Applying decomposition
[2024-05-29 13:45:38] [INFO ] Flatten gal took : 531 ms
[2024-05-29 13:45:38] [INFO ] Decomposing Gal with order
[2024-05-29 13:45:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:45:46] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-29 13:45:46] [INFO ] Flatten gal took : 871 ms
[2024-05-29 13:45:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 96 ms.
[2024-05-29 13:45:48] [INFO ] Time to serialize gal into /tmp/LTLFireability2233521595163539464.gal : 36 ms
[2024-05-29 13:45:48] [INFO ] Time to serialize properties into /tmp/LTLFireability7526124050419549307.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2233521595163539464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7526124050419549307.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.i1.i0.u891.p2971!=1)")U((G("(i0.i1.i0.u891.p2971!=1)"))||(("(i0.i1.i0.u891.p2971!=1)")&&(G(!("((i0.i0.i0.i0.i0.i0.i0.i0.i...276
Formula 0 simplified : XG(F"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u292.p966==1)&&(i0.i0.i0.i0.i1.i0.u795...198
Detected timeout of ITS tools.
[2024-05-29 14:09:37] [INFO ] Flatten gal took : 556 ms
[2024-05-29 14:09:40] [INFO ] Input system was already deterministic with 2414 transitions.
[2024-05-29 14:09:41] [INFO ] Transformed 2694 places.
[2024-05-29 14:09:41] [INFO ] Transformed 2414 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 14:09:41] [INFO ] Time to serialize gal into /tmp/LTLFireability8650251978883123739.gal : 14 ms
[2024-05-29 14:09:41] [INFO ] Time to serialize properties into /tmp/LTLFireability689849695956456041.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8650251978883123739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability689849695956456041.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(p2971!=1)")U((G("(p2971!=1)"))||(("(p2971!=1)")&&(G(!("((p966==1)&&(p2794==1))")))))))))
Formula 0 simplified : XG(F"((p966==1)&&(p2794==1))" U !"(p2971!=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14451992 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16015920 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789200418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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