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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 13 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 1.8M 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 ShieldPPPs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716981210338

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=ShieldPPPs-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 11:13:32] [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 11:13:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:13:32] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2024-05-29 11:13:32] [INFO ] Transformed 6803 places.
[2024-05-29 11:13:33] [INFO ] Transformed 6303 transitions.
[2024-05-29 11:13:33] [INFO ] Found NUPN structural information;
[2024-05-29 11:13:33] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 631 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 2 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 690 places :
Symmetric choice reduction at 0 with 690 rule applications. Total rules 690 place count 6113 transition count 5613
Iterating global reduction 0 with 690 rules applied. Total rules applied 1380 place count 6113 transition count 5613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1381 place count 6112 transition count 5612
Iterating global reduction 0 with 1 rules applied. Total rules applied 1382 place count 6112 transition count 5612
Applied a total of 1382 rules in 2743 ms. Remains 6112 /6803 variables (removed 691) and now considering 5612/6303 (removed 691) transitions.
// Phase 1: matrix 5612 rows 6112 cols
[2024-05-29 11:13:36] [INFO ] Computed 1101 invariants in 70 ms
[2024-05-29 11:13:38] [INFO ] Implicit Places using invariants in 2818 ms returned []
[2024-05-29 11:13:38] [INFO ] Invariant cache hit.
[2024-05-29 11:13:41] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 5197 ms to find 0 implicit places.
[2024-05-29 11:13:41] [INFO ] Invariant cache hit.
[2024-05-29 11:13:46] [INFO ] Dead Transitions using invariants and state equation in 4818 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6112/6803 places, 5612/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12762 ms. Remains : 6112/6803 places, 5612/6303 transitions.
Support contains 42 out of 6112 places after structural reductions.
[2024-05-29 11:13:46] [INFO ] Flatten gal took : 308 ms
[2024-05-29 11:13:46] [INFO ] Flatten gal took : 185 ms
[2024-05-29 11:13:47] [INFO ] Input system was already deterministic with 5612 transitions.
Support contains 40 out of 6112 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 27) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2024-05-29 11:13:48] [INFO ] Invariant cache hit.
[2024-05-29 11:13:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 733 ms returned sat
[2024-05-29 11:13:51] [INFO ] After 3402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-29 11:13:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 791 ms returned sat
[2024-05-29 11:14:05] [INFO ] After 9205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-29 11:14:08] [INFO ] Deduced a trap composed of 18 places in 2806 ms of which 16 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 25 places in 2830 ms of which 18 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 10 places in 2691 ms of which 5 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 19 places in 2698 ms of which 4 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 11:14:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:14:17] [INFO ] After 26101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 3 properties in 4687 ms.
Support contains 30 out of 6112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Drop transitions removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 695 place count 6112 transition count 4917
Reduce places removed 695 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 696 rules applied. Total rules applied 1391 place count 5417 transition count 4916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1392 place count 5416 transition count 4916
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1392 place count 5416 transition count 4416
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2392 place count 4916 transition count 4416
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2395 place count 4913 transition count 4413
Iterating global reduction 3 with 3 rules applied. Total rules applied 2398 place count 4913 transition count 4413
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2398 place count 4913 transition count 4410
Deduced a syphon composed of 3 places in 26 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2404 place count 4910 transition count 4410
Performed 1785 Post agglomeration using F-continuation condition.Transition count delta: 1785
Deduced a syphon composed of 1785 places in 7 ms
Reduce places removed 1785 places and 0 transitions.
Iterating global reduction 3 with 3570 rules applied. Total rules applied 5974 place count 3125 transition count 2625
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 888 times.
Drop transitions removed 888 transitions
Iterating global reduction 3 with 888 rules applied. Total rules applied 6862 place count 3125 transition count 2625
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6863 place count 3124 transition count 2624
Applied a total of 6863 rules in 2333 ms. Remains 3124 /6112 variables (removed 2988) and now considering 2624/5612 (removed 2988) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2334 ms. Remains : 3124/6112 places, 2624/5612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2624 rows 3124 cols
[2024-05-29 11:14:26] [INFO ] Computed 1101 invariants in 164 ms
[2024-05-29 11:14:27] [INFO ] After 833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 11:14:28] [INFO ] [Nat]Absence check using 1054 positive place invariants in 232 ms returned sat
[2024-05-29 11:14:28] [INFO ] [Nat]Absence check using 1054 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-29 11:14:32] [INFO ] After 2866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 2 ms to minimize.
[2024-05-29 11:14:33] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2024-05-29 11:14:33] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
[2024-05-29 11:14:34] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2024-05-29 11:14:34] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 0 ms to minimize.
[2024-05-29 11:14:35] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 1 ms to minimize.
[2024-05-29 11:14:35] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2024-05-29 11:14:35] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 1 ms to minimize.
[2024-05-29 11:14:36] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 2 ms to minimize.
[2024-05-29 11:14:36] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2024-05-29 11:14:37] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2024-05-29 11:14:37] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2024-05-29 11:14:37] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2024-05-29 11:14:38] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 11:14:38] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2024-05-29 11:14:39] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2024-05-29 11:14:39] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2024-05-29 11:14:39] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2024-05-29 11:14:40] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-29 11:14:40] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2024-05-29 11:14:40] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2024-05-29 11:14:41] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2024-05-29 11:14:41] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2024-05-29 11:14:41] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:14:42] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:14:42] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2024-05-29 11:14:42] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2024-05-29 11:14:42] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 4 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 11671 ms
[2024-05-29 11:14:44] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-29 11:14:44] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2024-05-29 11:14:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 605 ms
[2024-05-29 11:14:45] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 11:14:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2024-05-29 11:14:46] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 0 ms to minimize.
[2024-05-29 11:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2024-05-29 11:14:47] [INFO ] After 17555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1144 ms.
[2024-05-29 11:14:48] [INFO ] After 20348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 1150 ms.
Support contains 23 out of 3124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3124/3124 places, 2624/2624 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 3124 transition count 2623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3123 transition count 2623
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 3119 transition count 2619
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 3119 transition count 2619
Applied a total of 11 rules in 533 ms. Remains 3119 /3124 variables (removed 5) and now considering 2619/2624 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 3119/3124 places, 2619/2624 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 129320 steps, run timeout after 6001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 129320 steps, saw 121221 distinct states, run finished after 6003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2619 rows 3119 cols
[2024-05-29 11:14:57] [INFO ] Computed 1101 invariants in 35 ms
[2024-05-29 11:14:58] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 11:15:00] [INFO ] [Nat]Absence check using 1053 positive place invariants in 227 ms returned sat
[2024-05-29 11:15:00] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 16 ms returned sat
[2024-05-29 11:15:03] [INFO ] After 3004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 6 places in 515 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 6 places in 541 ms of which 2 ms to minimize.
[2024-05-29 11:15:05] [INFO ] Deduced a trap composed of 5 places in 487 ms of which 1 ms to minimize.
[2024-05-29 11:15:06] [INFO ] Deduced a trap composed of 5 places in 416 ms of which 1 ms to minimize.
[2024-05-29 11:15:06] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 1 ms to minimize.
[2024-05-29 11:15:07] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 1 ms to minimize.
[2024-05-29 11:15:07] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2024-05-29 11:15:08] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2024-05-29 11:15:08] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2024-05-29 11:15:09] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 2 ms to minimize.
[2024-05-29 11:15:09] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2024-05-29 11:15:10] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2024-05-29 11:15:10] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2024-05-29 11:15:11] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 1 ms to minimize.
[2024-05-29 11:15:11] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 5 ms to minimize.
[2024-05-29 11:15:12] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 1 ms to minimize.
[2024-05-29 11:15:12] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2024-05-29 11:15:12] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2024-05-29 11:15:13] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2024-05-29 11:15:14] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 1 ms to minimize.
[2024-05-29 11:15:14] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 1 ms to minimize.
[2024-05-29 11:15:15] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 2 ms to minimize.
[2024-05-29 11:15:15] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2024-05-29 11:15:16] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 1 ms to minimize.
[2024-05-29 11:15:16] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 2 ms to minimize.
[2024-05-29 11:15:16] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 4 ms to minimize.
[2024-05-29 11:15:17] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 2 ms to minimize.
[2024-05-29 11:15:17] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2024-05-29 11:15:18] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-29 11:15:18] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 1 ms to minimize.
[2024-05-29 11:15:18] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2024-05-29 11:15:19] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2024-05-29 11:15:19] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 1 ms to minimize.
[2024-05-29 11:15:20] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 0 ms to minimize.
[2024-05-29 11:15:20] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2024-05-29 11:15:20] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 0 ms to minimize.
[2024-05-29 11:15:21] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2024-05-29 11:15:21] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2024-05-29 11:15:22] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2024-05-29 11:15:22] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2024-05-29 11:15:22] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2024-05-29 11:15:23] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2024-05-29 11:15:23] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2024-05-29 11:15:23] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 1 ms to minimize.
[2024-05-29 11:15:24] [INFO ] Deduced a trap composed of 17 places in 257 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 11:15:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:15:24] [INFO ] After 25225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 1328 ms.
Support contains 23 out of 3119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3119/3119 places, 2619/2619 transitions.
Applied a total of 0 rules in 189 ms. Remains 3119 /3119 variables (removed 0) and now considering 2619/2619 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 3119/3119 places, 2619/2619 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3119/3119 places, 2619/2619 transitions.
Applied a total of 0 rules in 166 ms. Remains 3119 /3119 variables (removed 0) and now considering 2619/2619 (removed 0) transitions.
[2024-05-29 11:15:25] [INFO ] Invariant cache hit.
[2024-05-29 11:15:28] [INFO ] Implicit Places using invariants in 2679 ms returned []
[2024-05-29 11:15:28] [INFO ] Invariant cache hit.
[2024-05-29 11:15:34] [INFO ] Implicit Places using invariants and state equation in 5750 ms returned []
Implicit Place search using SMT with State Equation took 8431 ms to find 0 implicit places.
[2024-05-29 11:15:34] [INFO ] Redundant transitions in 189 ms returned []
[2024-05-29 11:15:34] [INFO ] Invariant cache hit.
[2024-05-29 11:15:36] [INFO ] Dead Transitions using invariants and state equation in 2249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11050 ms. Remains : 3119/3119 places, 2619/2619 transitions.
Computed a total of 1207 stabilizing places and 1207 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||G(p2)))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6104 transition count 5604
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6104 transition count 5604
Applied a total of 16 rules in 1503 ms. Remains 6104 /6112 variables (removed 8) and now considering 5604/5612 (removed 8) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2024-05-29 11:15:38] [INFO ] Computed 1101 invariants in 32 ms
[2024-05-29 11:15:41] [INFO ] Implicit Places using invariants in 2491 ms returned []
[2024-05-29 11:15:41] [INFO ] Invariant cache hit.
[2024-05-29 11:15:43] [INFO ] Implicit Places using invariants and state equation in 2627 ms returned []
Implicit Place search using SMT with State Equation took 5120 ms to find 0 implicit places.
[2024-05-29 11:15:43] [INFO ] Invariant cache hit.
[2024-05-29 11:15:48] [INFO ] Dead Transitions using invariants and state equation in 4610 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6112 places, 5604/5612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11247 ms. Remains : 6104/6112 places, 5604/5612 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 346 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s4352 0), p2:(EQ s4352 1), p1:(EQ s4284 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-01 finished in 11711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6111 transition count 4910
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5410 transition count 4910
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5410 transition count 4410
Deduced a syphon composed of 500 places in 23 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2402 place count 4910 transition count 4410
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2412 place count 4900 transition count 4400
Iterating global reduction 2 with 10 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4394
Deduced a syphon composed of 6 places in 20 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2434 place count 4894 transition count 4394
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 9 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6014 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6016 place count 3102 transition count 2602
Applied a total of 6016 rules in 1830 ms. Remains 3102 /6112 variables (removed 3010) and now considering 2602/5612 (removed 3010) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:15:50] [INFO ] Computed 1101 invariants in 15 ms
[2024-05-29 11:15:52] [INFO ] Implicit Places using invariants in 2214 ms returned []
[2024-05-29 11:15:52] [INFO ] Invariant cache hit.
[2024-05-29 11:15:57] [INFO ] Implicit Places using invariants and state equation in 4769 ms returned []
Implicit Place search using SMT with State Equation took 6985 ms to find 0 implicit places.
[2024-05-29 11:15:57] [INFO ] Redundant transitions in 124 ms returned []
[2024-05-29 11:15:57] [INFO ] Invariant cache hit.
[2024-05-29 11:15:59] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6112 places, 2602/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11068 ms. Remains : 3102/6112 places, 2602/5612 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2889 1) (EQ s2907 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 368 reset in 1696 ms.
Product exploration explored 100000 steps with 376 reset in 1942 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 245 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:16:04] [INFO ] Invariant cache hit.
[2024-05-29 11:16:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 1444 ms returned sat
[2024-05-29 11:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:16:19] [INFO ] [Real]Absence check using state equation in 9867 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 154 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2024-05-29 11:16:19] [INFO ] Invariant cache hit.
[2024-05-29 11:16:21] [INFO ] Implicit Places using invariants in 2047 ms returned []
[2024-05-29 11:16:21] [INFO ] Invariant cache hit.
[2024-05-29 11:16:26] [INFO ] Implicit Places using invariants and state equation in 4848 ms returned []
Implicit Place search using SMT with State Equation took 6900 ms to find 0 implicit places.
[2024-05-29 11:16:26] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 11:16:26] [INFO ] Invariant cache hit.
[2024-05-29 11:16:28] [INFO ] Dead Transitions using invariants and state equation in 2097 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9238 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 176 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:16:28] [INFO ] Invariant cache hit.
[2024-05-29 11:16:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 1554 ms returned sat
[2024-05-29 11:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:16:43] [INFO ] [Real]Absence check using state equation in 9620 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 12137 steps with 21 reset in 216 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-02 finished in 55366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&X(F(p0))))))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1457 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:16:45] [INFO ] Computed 1101 invariants in 28 ms
[2024-05-29 11:16:48] [INFO ] Implicit Places using invariants in 2751 ms returned []
[2024-05-29 11:16:48] [INFO ] Invariant cache hit.
[2024-05-29 11:16:51] [INFO ] Implicit Places using invariants and state equation in 2720 ms returned []
Implicit Place search using SMT with State Equation took 5479 ms to find 0 implicit places.
[2024-05-29 11:16:51] [INFO ] Invariant cache hit.
[2024-05-29 11:16:55] [INFO ] Dead Transitions using invariants and state equation in 4264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11208 ms. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2039 0) (EQ s2072 0)), p1:(OR (EQ s2637 0) (EQ s2661 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 1635 ms.
Product exploration explored 100000 steps with 23 reset in 2069 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 140758 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140758 steps, saw 138633 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 11:17:03] [INFO ] Invariant cache hit.
[2024-05-29 11:17:04] [INFO ] After 1032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:17:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 700 ms returned sat
[2024-05-29 11:17:11] [INFO ] After 5369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:17:14] [INFO ] Deduced a trap composed of 18 places in 2939 ms of which 3 ms to minimize.
[2024-05-29 11:17:17] [INFO ] Deduced a trap composed of 25 places in 2945 ms of which 4 ms to minimize.
[2024-05-29 11:17:21] [INFO ] Deduced a trap composed of 22 places in 2943 ms of which 3 ms to minimize.
[2024-05-29 11:17:24] [INFO ] Deduced a trap composed of 22 places in 2952 ms of which 4 ms to minimize.
[2024-05-29 11:17:27] [INFO ] Deduced a trap composed of 16 places in 2968 ms of which 4 ms to minimize.
[2024-05-29 11:17:30] [INFO ] Deduced a trap composed of 23 places in 2963 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:17:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:17:30] [INFO ] After 26247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 651 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1345 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1346 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76520 steps, run timeout after 3095 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 76520 steps, saw 71782 distinct states, run finished after 3095 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:17:36] [INFO ] Computed 1101 invariants in 39 ms
[2024-05-29 11:17:36] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:17:37] [INFO ] [Nat]Absence check using 1048 positive place invariants in 236 ms returned sat
[2024-05-29 11:17:37] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 13 ms returned sat
[2024-05-29 11:17:40] [INFO ] After 2115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:17:40] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 0 ms to minimize.
[2024-05-29 11:17:40] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-29 11:17:41] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 0 ms to minimize.
[2024-05-29 11:17:41] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-29 11:17:41] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-29 11:17:42] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 11:17:42] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2024-05-29 11:17:42] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2024-05-29 11:17:43] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-05-29 11:17:43] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2024-05-29 11:17:44] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2024-05-29 11:17:44] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2024-05-29 11:17:44] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2024-05-29 11:17:45] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 11:17:45] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2024-05-29 11:17:45] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2024-05-29 11:17:46] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2024-05-29 11:17:46] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2024-05-29 11:17:46] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2024-05-29 11:17:47] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 11:17:47] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 11:17:47] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2024-05-29 11:17:48] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2024-05-29 11:17:48] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-29 11:17:48] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-29 11:17:48] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-29 11:17:49] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2024-05-29 11:17:49] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2024-05-29 11:17:49] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2024-05-29 11:17:50] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2024-05-29 11:17:50] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2024-05-29 11:17:50] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2024-05-29 11:17:51] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:17:51] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 11:17:51] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2024-05-29 11:17:51] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2024-05-29 11:17:52] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2024-05-29 11:17:52] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2024-05-29 11:17:52] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2024-05-29 11:17:52] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2024-05-29 11:17:53] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-29 11:17:53] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2024-05-29 11:17:53] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2024-05-29 11:17:54] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2024-05-29 11:17:54] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2024-05-29 11:17:54] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:17:55] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2024-05-29 11:17:55] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2024-05-29 11:17:55] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 2 ms to minimize.
[2024-05-29 11:17:55] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2024-05-29 11:17:56] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2024-05-29 11:17:56] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2024-05-29 11:17:56] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2024-05-29 11:17:57] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2024-05-29 11:17:57] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2024-05-29 11:17:57] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2024-05-29 11:17:57] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2024-05-29 11:17:58] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-05-29 11:17:58] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2024-05-29 11:17:58] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2024-05-29 11:17:58] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 11:17:59] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2024-05-29 11:17:59] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2024-05-29 11:17:59] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2024-05-29 11:17:59] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2024-05-29 11:18:00] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2024-05-29 11:18:00] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2024-05-29 11:18:00] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2024-05-29 11:18:00] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2024-05-29 11:18:00] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 11:18:01] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2024-05-29 11:18:01] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-05-29 11:18:01] [INFO ] Trap strengthening (SAT) tested/added 73/72 trap constraints in 21429 ms
[2024-05-29 11:18:02] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:18:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:18:02] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 517 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 148 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 153 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:18:02] [INFO ] Invariant cache hit.
[2024-05-29 11:18:05] [INFO ] Implicit Places using invariants in 2449 ms returned []
[2024-05-29 11:18:05] [INFO ] Invariant cache hit.
[2024-05-29 11:18:11] [INFO ] Implicit Places using invariants and state equation in 6306 ms returned []
Implicit Place search using SMT with State Equation took 8758 ms to find 0 implicit places.
[2024-05-29 11:18:11] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:18:11] [INFO ] Invariant cache hit.
[2024-05-29 11:18:13] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11285 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 159 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 11:18:14] [INFO ] Invariant cache hit.
[2024-05-29 11:18:14] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:18:15] [INFO ] [Nat]Absence check using 1048 positive place invariants in 240 ms returned sat
[2024-05-29 11:18:15] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 13 ms returned sat
[2024-05-29 11:18:18] [INFO ] After 2514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:18:18] [INFO ] Deduced a trap composed of 4 places in 701 ms of which 2 ms to minimize.
[2024-05-29 11:18:19] [INFO ] Deduced a trap composed of 5 places in 704 ms of which 2 ms to minimize.
[2024-05-29 11:18:20] [INFO ] Deduced a trap composed of 4 places in 723 ms of which 1 ms to minimize.
[2024-05-29 11:18:21] [INFO ] Deduced a trap composed of 6 places in 709 ms of which 1 ms to minimize.
[2024-05-29 11:18:22] [INFO ] Deduced a trap composed of 5 places in 706 ms of which 2 ms to minimize.
[2024-05-29 11:18:23] [INFO ] Deduced a trap composed of 6 places in 690 ms of which 1 ms to minimize.
[2024-05-29 11:18:23] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 1 ms to minimize.
[2024-05-29 11:18:24] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 2 ms to minimize.
[2024-05-29 11:18:25] [INFO ] Deduced a trap composed of 5 places in 655 ms of which 2 ms to minimize.
[2024-05-29 11:18:26] [INFO ] Deduced a trap composed of 6 places in 652 ms of which 1 ms to minimize.
[2024-05-29 11:18:26] [INFO ] Deduced a trap composed of 6 places in 659 ms of which 1 ms to minimize.
[2024-05-29 11:18:27] [INFO ] Deduced a trap composed of 6 places in 615 ms of which 2 ms to minimize.
[2024-05-29 11:18:28] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 1 ms to minimize.
[2024-05-29 11:18:28] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 1 ms to minimize.
[2024-05-29 11:18:29] [INFO ] Deduced a trap composed of 6 places in 621 ms of which 1 ms to minimize.
[2024-05-29 11:18:30] [INFO ] Deduced a trap composed of 8 places in 603 ms of which 1 ms to minimize.
[2024-05-29 11:18:31] [INFO ] Deduced a trap composed of 5 places in 563 ms of which 2 ms to minimize.
[2024-05-29 11:18:31] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 1 ms to minimize.
[2024-05-29 11:18:32] [INFO ] Deduced a trap composed of 9 places in 513 ms of which 1 ms to minimize.
[2024-05-29 11:18:32] [INFO ] Deduced a trap composed of 6 places in 518 ms of which 1 ms to minimize.
[2024-05-29 11:18:33] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2024-05-29 11:18:34] [INFO ] Deduced a trap composed of 9 places in 524 ms of which 1 ms to minimize.
[2024-05-29 11:18:34] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 1 ms to minimize.
[2024-05-29 11:18:35] [INFO ] Deduced a trap composed of 6 places in 518 ms of which 1 ms to minimize.
[2024-05-29 11:18:35] [INFO ] Deduced a trap composed of 9 places in 477 ms of which 1 ms to minimize.
[2024-05-29 11:18:36] [INFO ] Deduced a trap composed of 6 places in 467 ms of which 1 ms to minimize.
[2024-05-29 11:18:37] [INFO ] Deduced a trap composed of 6 places in 477 ms of which 1 ms to minimize.
[2024-05-29 11:18:37] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2024-05-29 11:18:38] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2024-05-29 11:18:38] [INFO ] Deduced a trap composed of 8 places in 496 ms of which 1 ms to minimize.
[2024-05-29 11:18:39] [INFO ] Deduced a trap composed of 6 places in 501 ms of which 1 ms to minimize.
[2024-05-29 11:18:40] [INFO ] Deduced a trap composed of 6 places in 483 ms of which 1 ms to minimize.
[2024-05-29 11:18:40] [INFO ] Deduced a trap composed of 6 places in 490 ms of which 1 ms to minimize.
[2024-05-29 11:18:41] [INFO ] Deduced a trap composed of 6 places in 489 ms of which 1 ms to minimize.
[2024-05-29 11:18:41] [INFO ] Deduced a trap composed of 12 places in 497 ms of which 1 ms to minimize.
[2024-05-29 11:18:42] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 3 ms to minimize.
[2024-05-29 11:18:42] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 2 ms to minimize.
[2024-05-29 11:18:43] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 2 ms to minimize.
[2024-05-29 11:18:43] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 1 ms to minimize.
[2024-05-29 11:18:44] [INFO ] Deduced a trap composed of 8 places in 422 ms of which 1 ms to minimize.
[2024-05-29 11:18:44] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2024-05-29 11:18:45] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2024-05-29 11:18:45] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 1 ms to minimize.
[2024-05-29 11:18:46] [INFO ] Deduced a trap composed of 23 places in 421 ms of which 1 ms to minimize.
[2024-05-29 11:18:46] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 1 ms to minimize.
[2024-05-29 11:18:47] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 1 ms to minimize.
[2024-05-29 11:18:47] [INFO ] Deduced a trap composed of 17 places in 370 ms of which 1 ms to minimize.
[2024-05-29 11:18:48] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 2 ms to minimize.
[2024-05-29 11:18:48] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2024-05-29 11:18:49] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
[2024-05-29 11:18:49] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 2 ms to minimize.
[2024-05-29 11:18:50] [INFO ] Deduced a trap composed of 39 places in 400 ms of which 1 ms to minimize.
[2024-05-29 11:18:50] [INFO ] Deduced a trap composed of 34 places in 371 ms of which 1 ms to minimize.
[2024-05-29 11:18:50] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 32666 ms
[2024-05-29 11:18:51] [INFO ] After 35761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 367 ms.
[2024-05-29 11:18:51] [INFO ] After 37087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 675 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:18:52] [INFO ] Computed 1101 invariants in 20 ms
[2024-05-29 11:18:55] [INFO ] Implicit Places using invariants in 2590 ms returned []
[2024-05-29 11:18:55] [INFO ] Invariant cache hit.
[2024-05-29 11:18:58] [INFO ] Implicit Places using invariants and state equation in 2571 ms returned []
Implicit Place search using SMT with State Equation took 5174 ms to find 0 implicit places.
[2024-05-29 11:18:58] [INFO ] Invariant cache hit.
[2024-05-29 11:19:02] [INFO ] Dead Transitions using invariants and state equation in 4131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9980 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 79 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 151456 steps, run timeout after 3002 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151456 steps, saw 149194 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 11:19:06] [INFO ] Invariant cache hit.
[2024-05-29 11:19:07] [INFO ] After 1009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:19:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 735 ms returned sat
[2024-05-29 11:19:15] [INFO ] After 6235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:19:18] [INFO ] Deduced a trap composed of 18 places in 3030 ms of which 5 ms to minimize.
[2024-05-29 11:19:21] [INFO ] Deduced a trap composed of 25 places in 3096 ms of which 4 ms to minimize.
[2024-05-29 11:19:25] [INFO ] Deduced a trap composed of 22 places in 3141 ms of which 4 ms to minimize.
[2024-05-29 11:19:28] [INFO ] Deduced a trap composed of 22 places in 3022 ms of which 4 ms to minimize.
[2024-05-29 11:19:31] [INFO ] Deduced a trap composed of 16 places in 3184 ms of which 5 ms to minimize.
[2024-05-29 11:19:35] [INFO ] Deduced a trap composed of 23 places in 3205 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:19:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:19:35] [INFO ] After 28153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 823 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1428 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1428 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 77079 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77079 steps, saw 72304 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:19:41] [INFO ] Computed 1101 invariants in 24 ms
[2024-05-29 11:19:41] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:19:42] [INFO ] [Nat]Absence check using 1048 positive place invariants in 212 ms returned sat
[2024-05-29 11:19:42] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 12 ms returned sat
[2024-05-29 11:19:45] [INFO ] After 2295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:19:45] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 0 ms to minimize.
[2024-05-29 11:19:46] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-29 11:19:46] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 0 ms to minimize.
[2024-05-29 11:19:46] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2024-05-29 11:19:47] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 0 ms to minimize.
[2024-05-29 11:19:47] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2024-05-29 11:19:48] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2024-05-29 11:19:48] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 0 ms to minimize.
[2024-05-29 11:19:48] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 1 ms to minimize.
[2024-05-29 11:19:49] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 0 ms to minimize.
[2024-05-29 11:19:49] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2024-05-29 11:19:50] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2024-05-29 11:19:50] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2024-05-29 11:19:50] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2024-05-29 11:19:51] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2024-05-29 11:19:51] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 0 ms to minimize.
[2024-05-29 11:19:51] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2024-05-29 11:19:52] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2024-05-29 11:19:52] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2024-05-29 11:19:52] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-29 11:19:53] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2024-05-29 11:19:53] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 2 ms to minimize.
[2024-05-29 11:19:53] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 3 ms to minimize.
[2024-05-29 11:19:54] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-29 11:19:54] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2024-05-29 11:19:55] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2024-05-29 11:19:55] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2024-05-29 11:19:55] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2024-05-29 11:19:55] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2024-05-29 11:19:56] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 4 ms to minimize.
[2024-05-29 11:19:56] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2024-05-29 11:19:56] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 0 ms to minimize.
[2024-05-29 11:19:57] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2024-05-29 11:19:57] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-29 11:19:57] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2024-05-29 11:19:58] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2024-05-29 11:19:58] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2024-05-29 11:19:58] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2024-05-29 11:19:59] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 0 ms to minimize.
[2024-05-29 11:19:59] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2024-05-29 11:19:59] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-29 11:20:00] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2024-05-29 11:20:00] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2024-05-29 11:20:00] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2024-05-29 11:20:00] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2024-05-29 11:20:01] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2024-05-29 11:20:01] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2024-05-29 11:20:01] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2024-05-29 11:20:02] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2024-05-29 11:20:02] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2024-05-29 11:20:02] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2024-05-29 11:20:03] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 11:20:03] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:20:03] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2024-05-29 11:20:03] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2024-05-29 11:20:04] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2024-05-29 11:20:04] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2024-05-29 11:20:04] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 11:20:04] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2024-05-29 11:20:05] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2024-05-29 11:20:05] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 11:20:05] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2024-05-29 11:20:05] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2024-05-29 11:20:06] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2024-05-29 11:20:06] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2024-05-29 11:20:06] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2024-05-29 11:20:06] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2024-05-29 11:20:09] [INFO ] Deduced a trap composed of 2 places in 2719 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:20:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:20:09] [INFO ] After 27742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 556 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 164 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 155 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:20:10] [INFO ] Invariant cache hit.
[2024-05-29 11:20:13] [INFO ] Implicit Places using invariants in 2580 ms returned []
[2024-05-29 11:20:13] [INFO ] Invariant cache hit.
[2024-05-29 11:20:18] [INFO ] Implicit Places using invariants and state equation in 4958 ms returned []
Implicit Place search using SMT with State Equation took 7568 ms to find 0 implicit places.
[2024-05-29 11:20:18] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:20:18] [INFO ] Invariant cache hit.
[2024-05-29 11:20:20] [INFO ] Dead Transitions using invariants and state equation in 2114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9918 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 155 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 11:20:20] [INFO ] Invariant cache hit.
[2024-05-29 11:20:20] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:20:21] [INFO ] [Nat]Absence check using 1048 positive place invariants in 214 ms returned sat
[2024-05-29 11:20:21] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 13 ms returned sat
[2024-05-29 11:20:24] [INFO ] After 2122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:20:24] [INFO ] Deduced a trap composed of 4 places in 732 ms of which 1 ms to minimize.
[2024-05-29 11:20:25] [INFO ] Deduced a trap composed of 5 places in 721 ms of which 1 ms to minimize.
[2024-05-29 11:20:26] [INFO ] Deduced a trap composed of 4 places in 687 ms of which 2 ms to minimize.
[2024-05-29 11:20:27] [INFO ] Deduced a trap composed of 6 places in 679 ms of which 1 ms to minimize.
[2024-05-29 11:20:27] [INFO ] Deduced a trap composed of 5 places in 667 ms of which 2 ms to minimize.
[2024-05-29 11:20:28] [INFO ] Deduced a trap composed of 6 places in 614 ms of which 1 ms to minimize.
[2024-05-29 11:20:29] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 1 ms to minimize.
[2024-05-29 11:20:30] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 1 ms to minimize.
[2024-05-29 11:20:31] [INFO ] Deduced a trap composed of 5 places in 694 ms of which 1 ms to minimize.
[2024-05-29 11:20:31] [INFO ] Deduced a trap composed of 6 places in 680 ms of which 1 ms to minimize.
[2024-05-29 11:20:32] [INFO ] Deduced a trap composed of 6 places in 654 ms of which 1 ms to minimize.
[2024-05-29 11:20:33] [INFO ] Deduced a trap composed of 6 places in 623 ms of which 1 ms to minimize.
[2024-05-29 11:20:34] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-05-29 11:20:34] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 1 ms to minimize.
[2024-05-29 11:20:35] [INFO ] Deduced a trap composed of 6 places in 564 ms of which 2 ms to minimize.
[2024-05-29 11:20:36] [INFO ] Deduced a trap composed of 8 places in 541 ms of which 1 ms to minimize.
[2024-05-29 11:20:36] [INFO ] Deduced a trap composed of 5 places in 558 ms of which 1 ms to minimize.
[2024-05-29 11:20:37] [INFO ] Deduced a trap composed of 6 places in 508 ms of which 1 ms to minimize.
[2024-05-29 11:20:37] [INFO ] Deduced a trap composed of 9 places in 494 ms of which 1 ms to minimize.
[2024-05-29 11:20:38] [INFO ] Deduced a trap composed of 6 places in 514 ms of which 1 ms to minimize.
[2024-05-29 11:20:39] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 1 ms to minimize.
[2024-05-29 11:20:39] [INFO ] Deduced a trap composed of 9 places in 527 ms of which 1 ms to minimize.
[2024-05-29 11:20:40] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 2 ms to minimize.
[2024-05-29 11:20:41] [INFO ] Deduced a trap composed of 6 places in 529 ms of which 1 ms to minimize.
[2024-05-29 11:20:41] [INFO ] Deduced a trap composed of 9 places in 500 ms of which 2 ms to minimize.
[2024-05-29 11:20:42] [INFO ] Deduced a trap composed of 6 places in 520 ms of which 1 ms to minimize.
[2024-05-29 11:20:42] [INFO ] Deduced a trap composed of 6 places in 531 ms of which 1 ms to minimize.
[2024-05-29 11:20:43] [INFO ] Deduced a trap composed of 6 places in 536 ms of which 1 ms to minimize.
[2024-05-29 11:20:44] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 1 ms to minimize.
[2024-05-29 11:20:44] [INFO ] Deduced a trap composed of 8 places in 491 ms of which 1 ms to minimize.
[2024-05-29 11:20:45] [INFO ] Deduced a trap composed of 6 places in 526 ms of which 1 ms to minimize.
[2024-05-29 11:20:45] [INFO ] Deduced a trap composed of 6 places in 521 ms of which 1 ms to minimize.
[2024-05-29 11:20:46] [INFO ] Deduced a trap composed of 6 places in 512 ms of which 1 ms to minimize.
[2024-05-29 11:20:47] [INFO ] Deduced a trap composed of 6 places in 475 ms of which 1 ms to minimize.
[2024-05-29 11:20:47] [INFO ] Deduced a trap composed of 12 places in 528 ms of which 1 ms to minimize.
[2024-05-29 11:20:48] [INFO ] Deduced a trap composed of 6 places in 435 ms of which 1 ms to minimize.
[2024-05-29 11:20:48] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 1 ms to minimize.
[2024-05-29 11:20:49] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2024-05-29 11:20:49] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 1 ms to minimize.
[2024-05-29 11:20:50] [INFO ] Deduced a trap composed of 8 places in 435 ms of which 1 ms to minimize.
[2024-05-29 11:20:50] [INFO ] Deduced a trap composed of 17 places in 463 ms of which 1 ms to minimize.
[2024-05-29 11:20:51] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 1 ms to minimize.
[2024-05-29 11:20:51] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 1 ms to minimize.
[2024-05-29 11:20:52] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 1 ms to minimize.
[2024-05-29 11:20:52] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2024-05-29 11:20:53] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 1 ms to minimize.
[2024-05-29 11:20:53] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 1 ms to minimize.
[2024-05-29 11:20:54] [INFO ] Deduced a trap composed of 6 places in 373 ms of which 1 ms to minimize.
[2024-05-29 11:20:54] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2024-05-29 11:20:55] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 1 ms to minimize.
[2024-05-29 11:20:55] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 1 ms to minimize.
[2024-05-29 11:20:56] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 1 ms to minimize.
[2024-05-29 11:20:56] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2024-05-29 11:20:56] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 32700 ms
[2024-05-29 11:20:57] [INFO ] After 35383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 359 ms.
[2024-05-29 11:20:57] [INFO ] After 36662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 1511 ms.
Product exploration explored 100000 steps with 11 reset in 1961 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6102 transition count 5602
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 699 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 29 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2095 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2997 places in 10 ms
Iterating global reduction 1 with 2095 rules applied. Total rules applied 2997 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 3695 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 9 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 4393 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 10 ms
Applied a total of 4393 rules in 4573 ms. Remains 5404 /6102 variables (removed 698) and now considering 4905/5602 (removed 697) transitions.
[2024-05-29 11:21:06] [INFO ] Redundant transitions in 249 ms returned []
// Phase 1: matrix 4905 rows 5404 cols
[2024-05-29 11:21:06] [INFO ] Computed 1101 invariants in 147 ms
[2024-05-29 11:21:10] [INFO ] Dead Transitions using invariants and state equation in 4110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5404/6102 places, 4905/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8956 ms. Remains : 5404/6102 places, 4905/5602 transitions.
Built C files in :
/tmp/ltsmin17758737407344194150
[2024-05-29 11:21:11] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17758737407344194150
Running compilation step : cd /tmp/ltsmin17758737407344194150;'/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/ltsmin17758737407344194150;'/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/ltsmin17758737407344194150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 649 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:21:14] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 11:21:17] [INFO ] Implicit Places using invariants in 2499 ms returned []
[2024-05-29 11:21:17] [INFO ] Invariant cache hit.
[2024-05-29 11:21:19] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2024-05-29 11:21:19] [INFO ] Invariant cache hit.
[2024-05-29 11:21:24] [INFO ] Dead Transitions using invariants and state equation in 4397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10017 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Built C files in :
/tmp/ltsmin3332974784030421481
[2024-05-29 11:21:24] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3332974784030421481
Running compilation step : cd /tmp/ltsmin3332974784030421481;'/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/ltsmin3332974784030421481;'/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/ltsmin3332974784030421481;'/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 11:21:27] [INFO ] Flatten gal took : 146 ms
[2024-05-29 11:21:27] [INFO ] Flatten gal took : 167 ms
[2024-05-29 11:21:27] [INFO ] Time to serialize gal into /tmp/LTL3261270302039824500.gal : 38 ms
[2024-05-29 11:21:27] [INFO ] Time to serialize properties into /tmp/LTL9120859317784714427.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/LTL3261270302039824500.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5949975707762567654.hoa' '-atoms' '/tmp/LTL9120859317784714427.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9120859317784714427.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5949975707762567654.hoa
Detected timeout of ITS tools.
[2024-05-29 11:21:43] [INFO ] Flatten gal took : 155 ms
[2024-05-29 11:21:43] [INFO ] Flatten gal took : 168 ms
[2024-05-29 11:21:43] [INFO ] Time to serialize gal into /tmp/LTL6101151549129204053.gal : 32 ms
[2024-05-29 11:21:43] [INFO ] Time to serialize properties into /tmp/LTL14715733909398350922.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6101151549129204053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14715733909398350922.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(F(((G("((p2931==0)||(p2956==0))"))&&(X(F("((p2263==0)||(p2300==0))"))))&&("((p2263==0)||(p2300==0))")))))
Formula 0 simplified : XG(!"((p2263==0)||(p2300==0))" | F!"((p2931==0)||(p2956==0))" | XG!"((p2263==0)||(p2300==0))")
Detected timeout of ITS tools.
[2024-05-29 11:21:58] [INFO ] Flatten gal took : 134 ms
[2024-05-29 11:21:58] [INFO ] Applying decomposition
[2024-05-29 11:21:58] [INFO ] Flatten gal took : 130 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/graph18333747153010871726.txt' '-o' '/tmp/graph18333747153010871726.bin' '-w' '/tmp/graph18333747153010871726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18333747153010871726.bin' '-l' '-1' '-v' '-w' '/tmp/graph18333747153010871726.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:21:59] [INFO ] Decomposing Gal with order
[2024-05-29 11:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:22:01] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-29 11:22:01] [INFO ] Flatten gal took : 503 ms
[2024-05-29 11:22:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 59 ms.
[2024-05-29 11:22:01] [INFO ] Time to serialize gal into /tmp/LTL3169648040854708185.gal : 57 ms
[2024-05-29 11:22:01] [INFO ] Time to serialize properties into /tmp/LTL8215027366076526401.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/LTL3169648040854708185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8215027366076526401.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((i27.i0.i0.i1.u1043.p2931==0)||(i27.i0.i0.i2.u1053.p2956==0))"))&&(X(F("((i21.u809.p2263==0)||(i21.u822.p2300==0))"))))&&...205
Formula 0 simplified : XG(!"((i21.u809.p2263==0)||(i21.u822.p2300==0))" | F!"((i27.i0.i0.i1.u1043.p2931==0)||(i27.i0.i0.i2.u1053.p2956==0))" | XG!"((i21.u8...191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin654348006237109327
[2024-05-29 11:22:16] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin654348006237109327
Running compilation step : cd /tmp/ltsmin654348006237109327;'/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/ltsmin654348006237109327;'/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/ltsmin654348006237109327;'/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 ShieldPPPs-PT-100B-LTLFireability-03 finished in 335743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6111 transition count 4911
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5411 transition count 4911
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1400 place count 5411 transition count 4410
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2402 place count 4910 transition count 4410
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2412 place count 4900 transition count 4400
Iterating global reduction 2 with 10 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4394
Deduced a syphon composed of 6 places in 40 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2434 place count 4894 transition count 4394
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 7 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6014 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6016 place count 3102 transition count 2602
Applied a total of 6016 rules in 1638 ms. Remains 3102 /6112 variables (removed 3010) and now considering 2602/5612 (removed 3010) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:22:21] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:22:23] [INFO ] Implicit Places using invariants in 2043 ms returned []
[2024-05-29 11:22:23] [INFO ] Invariant cache hit.
[2024-05-29 11:22:28] [INFO ] Implicit Places using invariants and state equation in 4914 ms returned []
Implicit Place search using SMT with State Equation took 6959 ms to find 0 implicit places.
[2024-05-29 11:22:28] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-29 11:22:28] [INFO ] Invariant cache hit.
[2024-05-29 11:22:30] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6112 places, 2602/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10882 ms. Remains : 3102/6112 places, 2602/5612 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1493 1) (EQ s1513 1) (EQ s1711 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6433 steps with 0 reset in 110 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-04 finished in 11061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6111 transition count 4910
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5410 transition count 4910
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1402 place count 5410 transition count 4409
Deduced a syphon composed of 501 places in 29 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2404 place count 4909 transition count 4409
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2413 place count 4900 transition count 4400
Iterating global reduction 2 with 9 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4395
Deduced a syphon composed of 5 places in 18 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2432 place count 4895 transition count 4395
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 7 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6012 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6014 place count 3103 transition count 2603
Applied a total of 6014 rules in 1620 ms. Remains 3103 /6112 variables (removed 3009) and now considering 2603/5612 (removed 3009) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:22:32] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-29 11:22:34] [INFO ] Implicit Places using invariants in 2333 ms returned []
[2024-05-29 11:22:34] [INFO ] Invariant cache hit.
[2024-05-29 11:22:39] [INFO ] Implicit Places using invariants and state equation in 4298 ms returned []
Implicit Place search using SMT with State Equation took 6634 ms to find 0 implicit places.
[2024-05-29 11:22:39] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:22:39] [INFO ] Invariant cache hit.
[2024-05-29 11:22:41] [INFO ] Dead Transitions using invariants and state equation in 2200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6112 places, 2603/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10532 ms. Remains : 3103/6112 places, 2603/5612 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s30 0) (EQ s1922 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14 reset in 2000 ms.
Product exploration explored 100000 steps with 15 reset in 2172 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93899 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93899 steps, saw 83700 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:22:49] [INFO ] Invariant cache hit.
[2024-05-29 11:22:49] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:22:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 225 ms returned sat
[2024-05-29 11:22:51] [INFO ] After 1567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:22:52] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-05-29 11:22:52] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2024-05-29 11:22:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2024-05-29 11:22:52] [INFO ] After 2124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-29 11:22:52] [INFO ] After 2866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Partial Free-agglomeration rule applied 601 times.
Drop transitions removed 601 transitions
Iterating global reduction 0 with 601 rules applied. Total rules applied 601 place count 3103 transition count 2603
Applied a total of 601 rules in 274 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39638 steps, run visited all 1 properties in 840 ms. (steps per millisecond=47 )
Probabilistic random walk after 39638 steps, saw 38859 distinct states, run finished after 842 ms. (steps per millisecond=47 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-05 finished in 23149 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&&X(p2))))))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6102 transition count 5602
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6102 transition count 5602
Applied a total of 20 rules in 1276 ms. Remains 6102 /6112 variables (removed 10) and now considering 5602/5612 (removed 10) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:22:55] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 11:22:58] [INFO ] Implicit Places using invariants in 2759 ms returned []
[2024-05-29 11:22:58] [INFO ] Invariant cache hit.
[2024-05-29 11:23:00] [INFO ] Implicit Places using invariants and state equation in 2572 ms returned []
Implicit Place search using SMT with State Equation took 5353 ms to find 0 implicit places.
[2024-05-29 11:23:00] [INFO ] Invariant cache hit.
[2024-05-29 11:23:05] [INFO ] Dead Transitions using invariants and state equation in 4386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6112 places, 5602/5612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11037 ms. Remains : 6102/6112 places, 5602/5612 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2526 0) (EQ s2560 0)), p1:(OR (EQ s4242 0) (EQ s1886 0)), p2:(EQ s4242 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1589 ms.
Product exploration explored 100000 steps with 8 reset in 2051 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 175 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 11:23:09] [INFO ] Invariant cache hit.
[2024-05-29 11:23:11] [INFO ] After 1279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 11:23:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 732 ms returned sat
[2024-05-29 11:23:20] [INFO ] After 6520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 11:23:23] [INFO ] Deduced a trap composed of 20 places in 3207 ms of which 4 ms to minimize.
[2024-05-29 11:23:26] [INFO ] Deduced a trap composed of 24 places in 2830 ms of which 4 ms to minimize.
[2024-05-29 11:23:29] [INFO ] Deduced a trap composed of 22 places in 3113 ms of which 4 ms to minimize.
[2024-05-29 11:23:33] [INFO ] Deduced a trap composed of 23 places in 2922 ms of which 3 ms to minimize.
[2024-05-29 11:23:36] [INFO ] Deduced a trap composed of 14 places in 2799 ms of which 3 ms to minimize.
[2024-05-29 11:23:39] [INFO ] Deduced a trap composed of 21 places in 2882 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:23:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:23:39] [INFO ] After 27914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 852 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 7 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1299 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1299 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 81317 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81317 steps, saw 75438 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:23:45] [INFO ] Computed 1101 invariants in 21 ms
[2024-05-29 11:23:45] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:23:46] [INFO ] [Nat]Absence check using 1055 positive place invariants in 254 ms returned sat
[2024-05-29 11:23:46] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-29 11:23:49] [INFO ] After 2442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:23:49] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 1 ms to minimize.
[2024-05-29 11:23:50] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 2 ms to minimize.
[2024-05-29 11:23:51] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2024-05-29 11:23:51] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2024-05-29 11:23:52] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2024-05-29 11:23:52] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2024-05-29 11:23:53] [INFO ] Deduced a trap composed of 5 places in 519 ms of which 1 ms to minimize.
[2024-05-29 11:23:54] [INFO ] Deduced a trap composed of 6 places in 485 ms of which 1 ms to minimize.
[2024-05-29 11:23:54] [INFO ] Deduced a trap composed of 6 places in 479 ms of which 1 ms to minimize.
[2024-05-29 11:23:55] [INFO ] Deduced a trap composed of 5 places in 471 ms of which 1 ms to minimize.
[2024-05-29 11:23:55] [INFO ] Deduced a trap composed of 8 places in 482 ms of which 1 ms to minimize.
[2024-05-29 11:23:56] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 1 ms to minimize.
[2024-05-29 11:23:56] [INFO ] Deduced a trap composed of 6 places in 460 ms of which 1 ms to minimize.
[2024-05-29 11:23:57] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 1 ms to minimize.
[2024-05-29 11:23:57] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 2 ms to minimize.
[2024-05-29 11:23:58] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2024-05-29 11:23:58] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 1 ms to minimize.
[2024-05-29 11:23:59] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
[2024-05-29 11:23:59] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 1 ms to minimize.
[2024-05-29 11:24:00] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 1 ms to minimize.
[2024-05-29 11:24:00] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2024-05-29 11:24:01] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 1 ms to minimize.
[2024-05-29 11:24:01] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 1 ms to minimize.
[2024-05-29 11:24:02] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 1 ms to minimize.
[2024-05-29 11:24:02] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 1 ms to minimize.
[2024-05-29 11:24:03] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2024-05-29 11:24:03] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2024-05-29 11:24:04] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2024-05-29 11:24:04] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 0 ms to minimize.
[2024-05-29 11:24:05] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 1 ms to minimize.
[2024-05-29 11:24:05] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2024-05-29 11:24:06] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2024-05-29 11:24:06] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 1 ms to minimize.
[2024-05-29 11:24:06] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 11:24:07] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-05-29 11:24:07] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2024-05-29 11:24:08] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2024-05-29 11:24:08] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 0 ms to minimize.
[2024-05-29 11:24:08] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 0 ms to minimize.
[2024-05-29 11:24:09] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 0 ms to minimize.
[2024-05-29 11:24:09] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2024-05-29 11:24:10] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 21059 ms
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-29 11:24:10] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:24:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:24:10] [INFO ] After 25269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 471 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 148 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 147 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2024-05-29 11:24:11] [INFO ] Invariant cache hit.
[2024-05-29 11:24:14] [INFO ] Implicit Places using invariants in 2634 ms returned []
[2024-05-29 11:24:14] [INFO ] Invariant cache hit.
[2024-05-29 11:24:20] [INFO ] Implicit Places using invariants and state equation in 5757 ms returned []
Implicit Place search using SMT with State Equation took 8393 ms to find 0 implicit places.
[2024-05-29 11:24:20] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-29 11:24:20] [INFO ] Invariant cache hit.
[2024-05-29 11:24:22] [INFO ] Dead Transitions using invariants and state equation in 2198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10838 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 156 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 11:24:22] [INFO ] Invariant cache hit.
[2024-05-29 11:24:23] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:24:23] [INFO ] [Nat]Absence check using 1055 positive place invariants in 235 ms returned sat
[2024-05-29 11:24:23] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-29 11:24:26] [INFO ] After 2283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:24:27] [INFO ] Deduced a trap composed of 6 places in 568 ms of which 1 ms to minimize.
[2024-05-29 11:24:27] [INFO ] Deduced a trap composed of 6 places in 528 ms of which 2 ms to minimize.
[2024-05-29 11:24:28] [INFO ] Deduced a trap composed of 6 places in 523 ms of which 1 ms to minimize.
[2024-05-29 11:24:28] [INFO ] Deduced a trap composed of 5 places in 526 ms of which 2 ms to minimize.
[2024-05-29 11:24:29] [INFO ] Deduced a trap composed of 5 places in 571 ms of which 1 ms to minimize.
[2024-05-29 11:24:30] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 1 ms to minimize.
[2024-05-29 11:24:30] [INFO ] Deduced a trap composed of 6 places in 554 ms of which 2 ms to minimize.
[2024-05-29 11:24:31] [INFO ] Deduced a trap composed of 6 places in 569 ms of which 1 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 4 places in 568 ms of which 1 ms to minimize.
[2024-05-29 11:24:32] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 1 ms to minimize.
[2024-05-29 11:24:33] [INFO ] Deduced a trap composed of 6 places in 517 ms of which 1 ms to minimize.
[2024-05-29 11:24:34] [INFO ] Deduced a trap composed of 4 places in 469 ms of which 1 ms to minimize.
[2024-05-29 11:24:34] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-29 11:24:35] [INFO ] Deduced a trap composed of 9 places in 452 ms of which 1 ms to minimize.
[2024-05-29 11:24:35] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 1 ms to minimize.
[2024-05-29 11:24:36] [INFO ] Deduced a trap composed of 4 places in 476 ms of which 1 ms to minimize.
[2024-05-29 11:24:36] [INFO ] Deduced a trap composed of 6 places in 404 ms of which 1 ms to minimize.
[2024-05-29 11:24:37] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 1 ms to minimize.
[2024-05-29 11:24:37] [INFO ] Deduced a trap composed of 6 places in 398 ms of which 1 ms to minimize.
[2024-05-29 11:24:38] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 1 ms to minimize.
[2024-05-29 11:24:38] [INFO ] Deduced a trap composed of 6 places in 408 ms of which 1 ms to minimize.
[2024-05-29 11:24:39] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 1 ms to minimize.
[2024-05-29 11:24:39] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-29 11:24:40] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2024-05-29 11:24:40] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 11:24:40] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 0 ms to minimize.
[2024-05-29 11:24:41] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2024-05-29 11:24:41] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 11:24:41] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2024-05-29 11:24:42] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2024-05-29 11:24:42] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2024-05-29 11:24:42] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2024-05-29 11:24:43] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2024-05-29 11:24:43] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2024-05-29 11:24:44] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2024-05-29 11:24:44] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 1 ms to minimize.
[2024-05-29 11:24:44] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 0 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2024-05-29 11:24:45] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2024-05-29 11:24:46] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2024-05-29 11:24:46] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 0 ms to minimize.
[2024-05-29 11:24:46] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2024-05-29 11:24:47] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2024-05-29 11:24:47] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2024-05-29 11:24:48] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2024-05-29 11:24:48] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2024-05-29 11:24:48] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2024-05-29 11:24:49] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2024-05-29 11:24:49] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2024-05-29 11:24:49] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-05-29 11:24:50] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2024-05-29 11:24:50] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2024-05-29 11:24:50] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2024-05-29 11:24:51] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2024-05-29 11:24:51] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 11:24:51] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2024-05-29 11:24:52] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2024-05-29 11:24:52] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2024-05-29 11:24:52] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2024-05-29 11:24:53] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2024-05-29 11:24:53] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2024-05-29 11:24:53] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2024-05-29 11:24:53] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-29 11:24:54] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2024-05-29 11:24:54] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2024-05-29 11:24:54] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2024-05-29 11:24:54] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2024-05-29 11:24:55] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2024-05-29 11:24:55] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 28998 ms
[2024-05-29 11:24:55] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2024-05-29 11:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2024-05-29 11:24:56] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2024-05-29 11:24:56] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2024-05-29 11:24:56] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 11:24:57] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2024-05-29 11:24:57] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2024-05-29 11:24:57] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2024-05-29 11:24:58] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2024-05-29 11:24:58] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2024-05-29 11:24:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2557 ms
[2024-05-29 11:24:58] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2024-05-29 11:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2024-05-29 11:24:58] [INFO ] After 34923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 415 ms.
[2024-05-29 11:24:59] [INFO ] After 36311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 388 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 651 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:25:00] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 11:25:03] [INFO ] Implicit Places using invariants in 2726 ms returned []
[2024-05-29 11:25:03] [INFO ] Invariant cache hit.
[2024-05-29 11:25:05] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 5259 ms to find 0 implicit places.
[2024-05-29 11:25:05] [INFO ] Invariant cache hit.
[2024-05-29 11:25:10] [INFO ] Dead Transitions using invariants and state equation in 4905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10818 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 169 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 11:25:11] [INFO ] Invariant cache hit.
[2024-05-29 11:25:13] [INFO ] After 1270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 11:25:15] [INFO ] [Nat]Absence check using 1101 positive place invariants in 776 ms returned sat
[2024-05-29 11:25:22] [INFO ] After 6503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 11:25:25] [INFO ] Deduced a trap composed of 20 places in 3006 ms of which 4 ms to minimize.
[2024-05-29 11:25:28] [INFO ] Deduced a trap composed of 24 places in 3158 ms of which 4 ms to minimize.
[2024-05-29 11:25:32] [INFO ] Deduced a trap composed of 22 places in 3000 ms of which 4 ms to minimize.
[2024-05-29 11:25:35] [INFO ] Deduced a trap composed of 23 places in 3179 ms of which 4 ms to minimize.
[2024-05-29 11:25:38] [INFO ] Deduced a trap composed of 14 places in 2928 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:25:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:25:38] [INFO ] After 25415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 981 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 6 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1314 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1315 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 80753 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80753 steps, saw 74898 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:25:44] [INFO ] Computed 1101 invariants in 20 ms
[2024-05-29 11:25:45] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:25:45] [INFO ] [Nat]Absence check using 1055 positive place invariants in 225 ms returned sat
[2024-05-29 11:25:45] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-29 11:25:48] [INFO ] After 2469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:25:49] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 1 ms to minimize.
[2024-05-29 11:25:49] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2024-05-29 11:25:50] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 1 ms to minimize.
[2024-05-29 11:25:51] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 1 ms to minimize.
[2024-05-29 11:25:51] [INFO ] Deduced a trap composed of 6 places in 520 ms of which 1 ms to minimize.
[2024-05-29 11:25:52] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2024-05-29 11:25:52] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 1 ms to minimize.
[2024-05-29 11:25:53] [INFO ] Deduced a trap composed of 6 places in 499 ms of which 1 ms to minimize.
[2024-05-29 11:25:54] [INFO ] Deduced a trap composed of 6 places in 480 ms of which 1 ms to minimize.
[2024-05-29 11:25:54] [INFO ] Deduced a trap composed of 5 places in 525 ms of which 1 ms to minimize.
[2024-05-29 11:25:55] [INFO ] Deduced a trap composed of 8 places in 503 ms of which 1 ms to minimize.
[2024-05-29 11:25:55] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 1 ms to minimize.
[2024-05-29 11:25:56] [INFO ] Deduced a trap composed of 6 places in 455 ms of which 1 ms to minimize.
[2024-05-29 11:25:56] [INFO ] Deduced a trap composed of 5 places in 467 ms of which 1 ms to minimize.
[2024-05-29 11:25:57] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2024-05-29 11:25:58] [INFO ] Deduced a trap composed of 6 places in 461 ms of which 1 ms to minimize.
[2024-05-29 11:25:58] [INFO ] Deduced a trap composed of 5 places in 478 ms of which 1 ms to minimize.
[2024-05-29 11:25:59] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 1 ms to minimize.
[2024-05-29 11:25:59] [INFO ] Deduced a trap composed of 6 places in 483 ms of which 1 ms to minimize.
[2024-05-29 11:26:00] [INFO ] Deduced a trap composed of 6 places in 451 ms of which 1 ms to minimize.
[2024-05-29 11:26:00] [INFO ] Deduced a trap composed of 6 places in 421 ms of which 1 ms to minimize.
[2024-05-29 11:26:01] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 1 ms to minimize.
[2024-05-29 11:26:01] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 1 ms to minimize.
[2024-05-29 11:26:02] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 1 ms to minimize.
[2024-05-29 11:26:02] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2024-05-29 11:26:03] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 5 ms to minimize.
[2024-05-29 11:26:03] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2024-05-29 11:26:04] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 1 ms to minimize.
[2024-05-29 11:26:04] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 0 ms to minimize.
[2024-05-29 11:26:05] [INFO ] Deduced a trap composed of 6 places in 368 ms of which 1 ms to minimize.
[2024-05-29 11:26:05] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 0 ms to minimize.
[2024-05-29 11:26:06] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 1 ms to minimize.
[2024-05-29 11:26:06] [INFO ] Deduced a trap composed of 8 places in 389 ms of which 0 ms to minimize.
[2024-05-29 11:26:07] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2024-05-29 11:26:07] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-29 11:26:08] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 0 ms to minimize.
[2024-05-29 11:26:08] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2024-05-29 11:26:08] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 1 ms to minimize.
[2024-05-29 11:26:09] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 0 ms to minimize.
[2024-05-29 11:26:09] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2024-05-29 11:26:10] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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 11:26:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:26:10] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 375 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 149 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 153 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2024-05-29 11:26:10] [INFO ] Invariant cache hit.
[2024-05-29 11:26:13] [INFO ] Implicit Places using invariants in 2507 ms returned []
[2024-05-29 11:26:13] [INFO ] Invariant cache hit.
[2024-05-29 11:26:19] [INFO ] Implicit Places using invariants and state equation in 5836 ms returned []
Implicit Place search using SMT with State Equation took 8357 ms to find 0 implicit places.
[2024-05-29 11:26:19] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-29 11:26:19] [INFO ] Invariant cache hit.
[2024-05-29 11:26:21] [INFO ] Dead Transitions using invariants and state equation in 2103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10712 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 154 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 11:26:21] [INFO ] Invariant cache hit.
[2024-05-29 11:26:22] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:26:23] [INFO ] [Nat]Absence check using 1055 positive place invariants in 219 ms returned sat
[2024-05-29 11:26:23] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-29 11:26:25] [INFO ] After 2239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:26:26] [INFO ] Deduced a trap composed of 6 places in 575 ms of which 1 ms to minimize.
[2024-05-29 11:26:26] [INFO ] Deduced a trap composed of 6 places in 545 ms of which 1 ms to minimize.
[2024-05-29 11:26:27] [INFO ] Deduced a trap composed of 6 places in 551 ms of which 1 ms to minimize.
[2024-05-29 11:26:28] [INFO ] Deduced a trap composed of 5 places in 526 ms of which 1 ms to minimize.
[2024-05-29 11:26:28] [INFO ] Deduced a trap composed of 5 places in 540 ms of which 1 ms to minimize.
[2024-05-29 11:26:29] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2024-05-29 11:26:29] [INFO ] Deduced a trap composed of 6 places in 525 ms of which 1 ms to minimize.
[2024-05-29 11:26:30] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 1 ms to minimize.
[2024-05-29 11:26:31] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 1 ms to minimize.
[2024-05-29 11:26:31] [INFO ] Deduced a trap composed of 4 places in 550 ms of which 1 ms to minimize.
[2024-05-29 11:26:32] [INFO ] Deduced a trap composed of 6 places in 514 ms of which 1 ms to minimize.
[2024-05-29 11:26:33] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 0 ms to minimize.
[2024-05-29 11:26:33] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 1 ms to minimize.
[2024-05-29 11:26:34] [INFO ] Deduced a trap composed of 9 places in 463 ms of which 1 ms to minimize.
[2024-05-29 11:26:34] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 1 ms to minimize.
[2024-05-29 11:26:35] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2024-05-29 11:26:35] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
[2024-05-29 11:26:36] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 1 ms to minimize.
[2024-05-29 11:26:36] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2024-05-29 11:26:37] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2024-05-29 11:26:37] [INFO ] Deduced a trap composed of 6 places in 426 ms of which 1 ms to minimize.
[2024-05-29 11:26:38] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2024-05-29 11:26:38] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2024-05-29 11:26:39] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2024-05-29 11:26:39] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-05-29 11:26:39] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 0 ms to minimize.
[2024-05-29 11:26:40] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2024-05-29 11:26:40] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-29 11:26:41] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2024-05-29 11:26:41] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 0 ms to minimize.
[2024-05-29 11:26:41] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-29 11:26:42] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 1 ms to minimize.
[2024-05-29 11:26:42] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2024-05-29 11:26:43] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2024-05-29 11:26:43] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 1 ms to minimize.
[2024-05-29 11:26:43] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 1 ms to minimize.
[2024-05-29 11:26:44] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2024-05-29 11:26:44] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2024-05-29 11:26:44] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 0 ms to minimize.
[2024-05-29 11:26:45] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2024-05-29 11:26:45] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 1 ms to minimize.
[2024-05-29 11:26:46] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2024-05-29 11:26:46] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2024-05-29 11:26:46] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2024-05-29 11:26:47] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2024-05-29 11:26:47] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-29 11:26:47] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2024-05-29 11:26:48] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2024-05-29 11:26:48] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 1 ms to minimize.
[2024-05-29 11:26:49] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2024-05-29 11:26:49] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2024-05-29 11:26:49] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2024-05-29 11:26:50] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2024-05-29 11:26:50] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2024-05-29 11:26:50] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2024-05-29 11:26:51] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2024-05-29 11:26:51] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2024-05-29 11:26:51] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2024-05-29 11:26:52] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2024-05-29 11:26:52] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2024-05-29 11:26:52] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2024-05-29 11:26:53] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2024-05-29 11:26:53] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2024-05-29 11:26:53] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-29 11:26:54] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2024-05-29 11:26:54] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2024-05-29 11:26:54] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 0 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 29993 ms
[2024-05-29 11:26:55] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2024-05-29 11:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2024-05-29 11:26:56] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2024-05-29 11:26:56] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2024-05-29 11:26:56] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-29 11:26:57] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2024-05-29 11:26:57] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2024-05-29 11:26:58] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2024-05-29 11:26:58] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2024-05-29 11:26:58] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 2 ms to minimize.
[2024-05-29 11:26:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2665 ms
[2024-05-29 11:26:59] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2024-05-29 11:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2024-05-29 11:26:59] [INFO ] After 36001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 391 ms.
[2024-05-29 11:26:59] [INFO ] After 37331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 329 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1593 ms.
Product exploration explored 100000 steps with 9 reset in 2005 ms.
Built C files in :
/tmp/ltsmin5583874207791587034
[2024-05-29 11:27:04] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5583874207791587034
Running compilation step : cd /tmp/ltsmin5583874207791587034;'/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/ltsmin5583874207791587034;'/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/ltsmin5583874207791587034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 632 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:27:07] [INFO ] Computed 1101 invariants in 31 ms
[2024-05-29 11:27:10] [INFO ] Implicit Places using invariants in 2505 ms returned []
[2024-05-29 11:27:10] [INFO ] Invariant cache hit.
[2024-05-29 11:27:12] [INFO ] Implicit Places using invariants and state equation in 2465 ms returned []
Implicit Place search using SMT with State Equation took 4999 ms to find 0 implicit places.
[2024-05-29 11:27:12] [INFO ] Invariant cache hit.
[2024-05-29 11:27:17] [INFO ] Dead Transitions using invariants and state equation in 4337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9982 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Built C files in :
/tmp/ltsmin3577305830844038922
[2024-05-29 11:27:17] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3577305830844038922
Running compilation step : cd /tmp/ltsmin3577305830844038922;'/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/ltsmin3577305830844038922;'/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/ltsmin3577305830844038922;'/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 11:27:20] [INFO ] Flatten gal took : 152 ms
[2024-05-29 11:27:20] [INFO ] Flatten gal took : 249 ms
[2024-05-29 11:27:20] [INFO ] Time to serialize gal into /tmp/LTL16370950949879474597.gal : 27 ms
[2024-05-29 11:27:20] [INFO ] Time to serialize properties into /tmp/LTL1310641822424325221.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/LTL16370950949879474597.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6085855189557771681.hoa' '-atoms' '/tmp/LTL1310641822424325221.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/LTL1310641822424325221.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6085855189557771681.hoa
Detected timeout of ITS tools.
[2024-05-29 11:27:36] [INFO ] Flatten gal took : 127 ms
[2024-05-29 11:27:36] [INFO ] Flatten gal took : 130 ms
[2024-05-29 11:27:36] [INFO ] Time to serialize gal into /tmp/LTL13819147908627789433.gal : 38 ms
[2024-05-29 11:27:36] [INFO ] Time to serialize properties into /tmp/LTL1084828772713683721.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/LTL13819147908627789433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1084828772713683721.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p2806==0)||(p2846==0))"))||((X("(p4724==0)"))&&("((p4724==0)||(p2092==0))"))))))
Formula 0 simplified : G(F!"((p2806==0)||(p2846==0))" & FG(!"((p4724==0)||(p2092==0))" | X!"(p4724==0)"))
Detected timeout of ITS tools.
[2024-05-29 11:27:51] [INFO ] Flatten gal took : 126 ms
[2024-05-29 11:27:51] [INFO ] Applying decomposition
[2024-05-29 11:27:51] [INFO ] Flatten gal took : 128 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/graph5552554913071570599.txt' '-o' '/tmp/graph5552554913071570599.bin' '-w' '/tmp/graph5552554913071570599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5552554913071570599.bin' '-l' '-1' '-v' '-w' '/tmp/graph5552554913071570599.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:27:52] [INFO ] Decomposing Gal with order
[2024-05-29 11:27:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:27:54] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-29 11:27:54] [INFO ] Flatten gal took : 253 ms
[2024-05-29 11:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2024-05-29 11:27:54] [INFO ] Time to serialize gal into /tmp/LTL499328947039067505.gal : 78 ms
[2024-05-29 11:27:54] [INFO ] Time to serialize properties into /tmp/LTL6179804896590958705.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/LTL499328947039067505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6179804896590958705.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i32.u997.p2806==0)||(i32.u1010.p2846==0))"))||((X("(i49.u1675.p4724==0)"))&&("((i49.u1675.p4724==0)||(i24.u746.p2092==0))...162
Formula 0 simplified : G(F!"((i32.u997.p2806==0)||(i32.u1010.p2846==0))" & FG(!"((i49.u1675.p4724==0)||(i24.u746.p2092==0))" | X!"(i49.u1675.p4724==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15506313106118282597
[2024-05-29 11:28:09] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15506313106118282597
Running compilation step : cd /tmp/ltsmin15506313106118282597;'/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/ltsmin15506313106118282597;'/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/ltsmin15506313106118282597;'/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 ShieldPPPs-PT-100B-LTLFireability-06 finished in 318603 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 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6103 transition count 5603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6103 transition count 5603
Applied a total of 18 rules in 1348 ms. Remains 6103 /6112 variables (removed 9) and now considering 5603/5612 (removed 9) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2024-05-29 11:28:14] [INFO ] Computed 1101 invariants in 24 ms
[2024-05-29 11:28:16] [INFO ] Implicit Places using invariants in 2576 ms returned []
[2024-05-29 11:28:16] [INFO ] Invariant cache hit.
[2024-05-29 11:28:19] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 5232 ms to find 0 implicit places.
[2024-05-29 11:28:19] [INFO ] Invariant cache hit.
[2024-05-29 11:28:24] [INFO ] Dead Transitions using invariants and state equation in 4792 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6112 places, 5603/5612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11374 ms. Remains : 6103/6112 places, 5603/5612 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-07 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 s1063 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 28 reset in 1117 ms.
Product exploration explored 100000 steps with 28 reset in 1350 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/6103 stabilizing places and 1200/5603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 9932 steps, including 2 resets, run visited all 1 properties in 122 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-29 11:28:27] [INFO ] Invariant cache hit.
[2024-05-29 11:28:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 6967 ms returned sat
[2024-05-29 11:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:28:42] [INFO ] [Real]Absence check using state equation in 1272 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 6103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4401
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2402 place count 4901 transition count 4401
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5996 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5998 place count 3102 transition count 2602
Applied a total of 5998 rules in 1309 ms. Remains 3102 /6103 variables (removed 3001) and now considering 2602/5603 (removed 3001) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:28:43] [INFO ] Computed 1101 invariants in 5 ms
[2024-05-29 11:28:45] [INFO ] Implicit Places using invariants in 2214 ms returned []
[2024-05-29 11:28:45] [INFO ] Invariant cache hit.
[2024-05-29 11:28:50] [INFO ] Implicit Places using invariants and state equation in 4573 ms returned []
Implicit Place search using SMT with State Equation took 6812 ms to find 0 implicit places.
[2024-05-29 11:28:50] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:28:50] [INFO ] Invariant cache hit.
[2024-05-29 11:28:52] [INFO ] Dead Transitions using invariants and state equation in 2091 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6103 places, 2602/5603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10291 ms. Remains : 3102/6103 places, 2602/5603 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/3102 stabilizing places and 2/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-29 11:28:53] [INFO ] Invariant cache hit.
[2024-05-29 11:28:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 1608 ms returned sat
[2024-05-29 11:28:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:29:08] [INFO ] [Real]Absence check using state equation in 9882 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22009 reset in 1685 ms.
Product exploration explored 100000 steps with 22167 reset in 2132 ms.
Built C files in :
/tmp/ltsmin11451623132150245371
[2024-05-29 11:29:12] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:29:12] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11451623132150245371
Running compilation step : cd /tmp/ltsmin11451623132150245371;'/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/ltsmin11451623132150245371;'/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/ltsmin11451623132150245371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 144 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2024-05-29 11:29:15] [INFO ] Invariant cache hit.
[2024-05-29 11:29:17] [INFO ] Implicit Places using invariants in 2174 ms returned []
[2024-05-29 11:29:17] [INFO ] Invariant cache hit.
[2024-05-29 11:29:22] [INFO ] Implicit Places using invariants and state equation in 4579 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
[2024-05-29 11:29:22] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:29:22] [INFO ] Invariant cache hit.
[2024-05-29 11:29:24] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9168 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin5783191515456277671
[2024-05-29 11:29:24] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:29:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5783191515456277671
Running compilation step : cd /tmp/ltsmin5783191515456277671;'/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/ltsmin5783191515456277671;'/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/ltsmin5783191515456277671;'/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 11:29:27] [INFO ] Flatten gal took : 90 ms
[2024-05-29 11:29:27] [INFO ] Flatten gal took : 74 ms
[2024-05-29 11:29:27] [INFO ] Time to serialize gal into /tmp/LTL6047106961081792283.gal : 13 ms
[2024-05-29 11:29:27] [INFO ] Time to serialize properties into /tmp/LTL12530407469681368851.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/LTL6047106961081792283.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11685641232024118097.hoa' '-atoms' '/tmp/LTL12530407469681368851.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/LTL12530407469681368851.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11685641232024118097.hoa
Detected timeout of ITS tools.
[2024-05-29 11:29:42] [INFO ] Flatten gal took : 72 ms
[2024-05-29 11:29:42] [INFO ] Flatten gal took : 74 ms
[2024-05-29 11:29:42] [INFO ] Time to serialize gal into /tmp/LTL4979074188166841141.gal : 12 ms
[2024-05-29 11:29:42] [INFO ] Time to serialize properties into /tmp/LTL15764012057756867403.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/LTL4979074188166841141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15764012057756867403.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(F("(p1174==1)"))))
Formula 0 simplified : XG!"(p1174==1)"
Detected timeout of ITS tools.
[2024-05-29 11:29:58] [INFO ] Flatten gal took : 73 ms
[2024-05-29 11:29:58] [INFO ] Applying decomposition
[2024-05-29 11:29:58] [INFO ] Flatten gal took : 69 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/graph9977707925713530956.txt' '-o' '/tmp/graph9977707925713530956.bin' '-w' '/tmp/graph9977707925713530956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9977707925713530956.bin' '-l' '-1' '-v' '-w' '/tmp/graph9977707925713530956.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:29:58] [INFO ] Decomposing Gal with order
[2024-05-29 11:29:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:29:58] [INFO ] Removed a total of 601 redundant transitions.
[2024-05-29 11:29:58] [INFO ] Flatten gal took : 103 ms
[2024-05-29 11:29:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 23 ms.
[2024-05-29 11:29:58] [INFO ] Time to serialize gal into /tmp/LTL12721410985105776311.gal : 60 ms
[2024-05-29 11:29:58] [INFO ] Time to serialize properties into /tmp/LTL7008451603991126312.ltl : 49 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/LTL12721410985105776311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7008451603991126312.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(i8.i0.i1.u177.p1174==1)"))))
Formula 0 simplified : XG!"(i8.i0.i1.u177.p1174==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6555532255340418522
[2024-05-29 11:30:13] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6555532255340418522
Running compilation step : cd /tmp/ltsmin6555532255340418522;'/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/ltsmin6555532255340418522;'/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/ltsmin6555532255340418522;'/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 ShieldPPPs-PT-100B-LTLFireability-07 finished in 124229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(((p1&&F(!p1)) U (!p1&&F(p2)))))))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6103 transition count 5603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6103 transition count 5603
Applied a total of 18 rules in 1342 ms. Remains 6103 /6112 variables (removed 9) and now considering 5603/5612 (removed 9) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2024-05-29 11:30:18] [INFO ] Computed 1101 invariants in 24 ms
[2024-05-29 11:30:20] [INFO ] Implicit Places using invariants in 2504 ms returned []
[2024-05-29 11:30:20] [INFO ] Invariant cache hit.
[2024-05-29 11:30:23] [INFO ] Implicit Places using invariants and state equation in 2568 ms returned []
Implicit Place search using SMT with State Equation took 5104 ms to find 0 implicit places.
[2024-05-29 11:30:23] [INFO ] Invariant cache hit.
[2024-05-29 11:30:27] [INFO ] Dead Transitions using invariants and state equation in 4404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6112 places, 5603/5612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10871 ms. Remains : 6103/6112 places, 5603/5612 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6023 1), p1:(NEQ s3669 1), p2:(EQ s4570 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15223 steps with 0 reset in 255 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-08 finished in 11374 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))&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6111 transition count 4911
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 5411 transition count 4910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 5410 transition count 4910
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1402 place count 5410 transition count 4410
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2402 place count 4910 transition count 4410
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2410 place count 4902 transition count 4402
Iterating global reduction 3 with 8 rules applied. Total rules applied 2418 place count 4902 transition count 4402
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2418 place count 4902 transition count 4398
Deduced a syphon composed of 4 places in 18 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2426 place count 4898 transition count 4398
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 6012 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6014 place count 3103 transition count 2603
Applied a total of 6014 rules in 1632 ms. Remains 3103 /6112 variables (removed 3009) and now considering 2603/5612 (removed 3009) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:30:29] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 11:30:32] [INFO ] Implicit Places using invariants in 2149 ms returned []
[2024-05-29 11:30:32] [INFO ] Invariant cache hit.
[2024-05-29 11:30:36] [INFO ] Implicit Places using invariants and state equation in 4574 ms returned []
Implicit Place search using SMT with State Equation took 6739 ms to find 0 implicit places.
[2024-05-29 11:30:36] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:30:36] [INFO ] Invariant cache hit.
[2024-05-29 11:30:38] [INFO ] Dead Transitions using invariants and state equation in 2056 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6112 places, 2603/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10520 ms. Remains : 3103/6112 places, 2603/5612 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(AND p2 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s1238 1), p0:(OR (NEQ s228 1) (NEQ s230 1)), p2:(NEQ s2484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 15 reset in 1738 ms.
Product exploration explored 100000 steps with 15 reset in 2334 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/3103 stabilizing places and 2/2603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 611 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 11:30:45] [INFO ] Invariant cache hit.
[2024-05-29 11:30:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 233 ms returned sat
[2024-05-29 11:30:47] [INFO ] After 2666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 11:30:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 11:30:50] [INFO ] After 2036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 11:30:51] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2024-05-29 11:30:51] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2024-05-29 11:30:51] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2024-05-29 11:30:51] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 11:30:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 912 ms
[2024-05-29 11:30:52] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-29 11:30:52] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-29 11:30:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2024-05-29 11:30:53] [INFO ] After 4141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 553 ms.
[2024-05-29 11:30:53] [INFO ] After 5803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3103 transition count 2603
Applied a total of 598 rules in 298 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 109867 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{0=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 109867 steps, saw 108645 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :4
Running SMT prover for 2 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:30:58] [INFO ] Computed 1101 invariants in 20 ms
[2024-05-29 11:30:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 221 ms returned sat
[2024-05-29 11:31:00] [INFO ] After 2412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:31:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 229 ms returned sat
[2024-05-29 11:31:03] [INFO ] After 1676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:31:03] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2024-05-29 11:31:03] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 10 ms to minimize.
[2024-05-29 11:31:04] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 0 ms to minimize.
[2024-05-29 11:31:04] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2024-05-29 11:31:04] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2024-05-29 11:31:05] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 0 ms to minimize.
[2024-05-29 11:31:05] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 0 ms to minimize.
[2024-05-29 11:31:05] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 1 ms to minimize.
[2024-05-29 11:31:05] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2024-05-29 11:31:06] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2024-05-29 11:31:06] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2024-05-29 11:31:06] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2024-05-29 11:31:06] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2024-05-29 11:31:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-29 11:31:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3759 ms
[2024-05-29 11:31:07] [INFO ] After 5668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2024-05-29 11:31:07] [INFO ] After 6627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 148 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 101455 steps, run timeout after 3005 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101455 steps, saw 100273 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:31:11] [INFO ] Invariant cache hit.
[2024-05-29 11:31:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 226 ms returned sat
[2024-05-29 11:31:13] [INFO ] After 2472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:31:14] [INFO ] [Nat]Absence check using 1101 positive place invariants in 223 ms returned sat
[2024-05-29 11:31:16] [INFO ] After 1706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:31:16] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 1 ms to minimize.
[2024-05-29 11:31:16] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 1 ms to minimize.
[2024-05-29 11:31:17] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 1 ms to minimize.
[2024-05-29 11:31:17] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 2 ms to minimize.
[2024-05-29 11:31:18] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 1 ms to minimize.
[2024-05-29 11:31:18] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2024-05-29 11:31:18] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-05-29 11:31:19] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2024-05-29 11:31:19] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2024-05-29 11:31:19] [INFO ] Deduced a trap composed of 126 places in 219 ms of which 1 ms to minimize.
[2024-05-29 11:31:20] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 1 ms to minimize.
[2024-05-29 11:31:20] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2024-05-29 11:31:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4279 ms
[2024-05-29 11:31:20] [INFO ] After 6232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2024-05-29 11:31:20] [INFO ] After 7176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 99 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 140 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 152 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:31:21] [INFO ] Invariant cache hit.
[2024-05-29 11:31:23] [INFO ] Implicit Places using invariants in 2650 ms returned []
[2024-05-29 11:31:23] [INFO ] Invariant cache hit.
[2024-05-29 11:31:29] [INFO ] Implicit Places using invariants and state equation in 5279 ms returned []
Implicit Place search using SMT with State Equation took 7948 ms to find 0 implicit places.
[2024-05-29 11:31:29] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-29 11:31:29] [INFO ] Invariant cache hit.
[2024-05-29 11:31:31] [INFO ] Dead Transitions using invariants and state equation in 2129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10351 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 157 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 11:31:31] [INFO ] Invariant cache hit.
[2024-05-29 11:31:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 11:31:34] [INFO ] After 2377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:31:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 218 ms returned sat
[2024-05-29 11:31:36] [INFO ] After 1709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:31:36] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2024-05-29 11:31:37] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 1 ms to minimize.
[2024-05-29 11:31:37] [INFO ] Deduced a trap composed of 17 places in 359 ms of which 1 ms to minimize.
[2024-05-29 11:31:38] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 1 ms to minimize.
[2024-05-29 11:31:38] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 0 ms to minimize.
[2024-05-29 11:31:38] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 0 ms to minimize.
[2024-05-29 11:31:39] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2024-05-29 11:31:39] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2024-05-29 11:31:39] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 1 ms to minimize.
[2024-05-29 11:31:40] [INFO ] Deduced a trap composed of 126 places in 244 ms of which 0 ms to minimize.
[2024-05-29 11:31:40] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 1 ms to minimize.
[2024-05-29 11:31:40] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2024-05-29 11:31:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4289 ms
[2024-05-29 11:31:41] [INFO ] After 6246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 187 ms.
[2024-05-29 11:31:41] [INFO ] After 7177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (F (NOT (AND p2 p1))), (F (AND (NOT p2) p1)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p1)))
Knowledge based reduction with 11 factoid took 702 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-09 finished in 73591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6111 transition count 4911
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 5411 transition count 4910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 5410 transition count 4910
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1402 place count 5410 transition count 4409
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2404 place count 4909 transition count 4409
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2414 place count 4899 transition count 4399
Iterating global reduction 3 with 10 rules applied. Total rules applied 2424 place count 4899 transition count 4399
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2424 place count 4899 transition count 4393
Deduced a syphon composed of 6 places in 19 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2436 place count 4893 transition count 4393
Performed 1788 Post agglomeration using F-continuation condition.Transition count delta: 1788
Deduced a syphon composed of 1788 places in 7 ms
Reduce places removed 1788 places and 0 transitions.
Iterating global reduction 3 with 3576 rules applied. Total rules applied 6012 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6013 place count 3104 transition count 2604
Applied a total of 6013 rules in 1581 ms. Remains 3104 /6112 variables (removed 3008) and now considering 2604/5612 (removed 3008) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:31:43] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 11:31:45] [INFO ] Implicit Places using invariants in 2052 ms returned []
[2024-05-29 11:31:45] [INFO ] Invariant cache hit.
[2024-05-29 11:31:50] [INFO ] Implicit Places using invariants and state equation in 4711 ms returned []
Implicit Place search using SMT with State Equation took 6794 ms to find 0 implicit places.
[2024-05-29 11:31:50] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:31:50] [INFO ] Invariant cache hit.
[2024-05-29 11:31:52] [INFO ] Dead Transitions using invariants and state equation in 2114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6112 places, 2604/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10590 ms. Remains : 3104/6112 places, 2604/5612 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2465 1) (EQ s2508 1) (EQ s3043 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 94 reset in 1589 ms.
Product exploration explored 100000 steps with 96 reset in 2054 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1063 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:31:56] [INFO ] Invariant cache hit.
[2024-05-29 11:32:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 1727 ms returned sat
[2024-05-29 11:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:32:11] [INFO ] [Real]Absence check using state equation in 9702 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 152 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:32:11] [INFO ] Invariant cache hit.
[2024-05-29 11:32:13] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2024-05-29 11:32:13] [INFO ] Invariant cache hit.
[2024-05-29 11:32:18] [INFO ] Implicit Places using invariants and state equation in 4649 ms returned []
Implicit Place search using SMT with State Equation took 6800 ms to find 0 implicit places.
[2024-05-29 11:32:18] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:32:18] [INFO ] Invariant cache hit.
[2024-05-29 11:32:20] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9168 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 964 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-05-29 11:32:21] [INFO ] Invariant cache hit.
[2024-05-29 11:32:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 1671 ms returned sat
[2024-05-29 11:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:32:36] [INFO ] [Real]Absence check using state equation in 9711 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 1284 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 96 reset in 1595 ms.
Product exploration explored 100000 steps with 95 reset in 2055 ms.
Built C files in :
/tmp/ltsmin12957499845700792292
[2024-05-29 11:32:41] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:32:41] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12957499845700792292
Running compilation step : cd /tmp/ltsmin12957499845700792292;'/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/ltsmin12957499845700792292;'/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/ltsmin12957499845700792292;'/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 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 162 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:32:44] [INFO ] Invariant cache hit.
[2024-05-29 11:32:46] [INFO ] Implicit Places using invariants in 2228 ms returned []
[2024-05-29 11:32:46] [INFO ] Invariant cache hit.
[2024-05-29 11:32:51] [INFO ] Implicit Places using invariants and state equation in 4385 ms returned []
Implicit Place search using SMT with State Equation took 6631 ms to find 0 implicit places.
[2024-05-29 11:32:51] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:32:51] [INFO ] Invariant cache hit.
[2024-05-29 11:32:53] [INFO ] Dead Transitions using invariants and state equation in 2152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9055 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin5259274907776325447
[2024-05-29 11:32:53] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:32:53] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5259274907776325447
Running compilation step : cd /tmp/ltsmin5259274907776325447;'/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/ltsmin5259274907776325447;'/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/ltsmin5259274907776325447;'/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 11:32:56] [INFO ] Flatten gal took : 113 ms
[2024-05-29 11:32:56] [INFO ] Flatten gal took : 116 ms
[2024-05-29 11:32:56] [INFO ] Time to serialize gal into /tmp/LTL9863654855022395870.gal : 11 ms
[2024-05-29 11:32:56] [INFO ] Time to serialize properties into /tmp/LTL16822929309202965334.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/LTL9863654855022395870.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16664314941033562807.hoa' '-atoms' '/tmp/LTL16822929309202965334.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/LTL16822929309202965334.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16664314941033562807.hoa
Detected timeout of ITS tools.
[2024-05-29 11:33:11] [INFO ] Flatten gal took : 118 ms
[2024-05-29 11:33:12] [INFO ] Flatten gal took : 134 ms
[2024-05-29 11:33:12] [INFO ] Time to serialize gal into /tmp/LTL17497445752914081906.gal : 12 ms
[2024-05-29 11:33:12] [INFO ] Time to serialize properties into /tmp/LTL6307536922184461602.ltl : 18 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/LTL17497445752914081906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6307536922184461602.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p5421==1)&&(p5511==1))&&(p6669==0))"))))
Formula 0 simplified : FG!"(((p5421==1)&&(p5511==1))&&(p6669==0))"
Detected timeout of ITS tools.
[2024-05-29 11:33:27] [INFO ] Flatten gal took : 110 ms
[2024-05-29 11:33:27] [INFO ] Applying decomposition
[2024-05-29 11:33:27] [INFO ] Flatten gal took : 110 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/graph18044652803008112764.txt' '-o' '/tmp/graph18044652803008112764.bin' '-w' '/tmp/graph18044652803008112764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18044652803008112764.bin' '-l' '-1' '-v' '-w' '/tmp/graph18044652803008112764.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:33:27] [INFO ] Decomposing Gal with order
[2024-05-29 11:33:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:33:27] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:33:27] [INFO ] Flatten gal took : 109 ms
[2024-05-29 11:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 148 ms.
[2024-05-29 11:33:28] [INFO ] Time to serialize gal into /tmp/LTL7993764539646868895.gal : 30 ms
[2024-05-29 11:33:28] [INFO ] Time to serialize properties into /tmp/LTL9498873692761636978.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/LTL7993764539646868895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9498873692761636978.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i46.i0.i2.u875.p5421==1)&&(i46.i1.i2.u890.p5511==1))&&(i56.i0.i1.u1087.p6669==0))"))))
Formula 0 simplified : FG!"(((i46.i0.i2.u875.p5421==1)&&(i46.i1.i2.u890.p5511==1))&&(i56.i0.i1.u1087.p6669==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3522517339383468339
[2024-05-29 11:33:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3522517339383468339
Running compilation step : cd /tmp/ltsmin3522517339383468339;'/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/ltsmin3522517339383468339;'/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/ltsmin3522517339383468339;'/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 ShieldPPPs-PT-100B-LTLFireability-10 finished in 124350 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((X(F(p1))||p0))))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5409 transition count 4409
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4909 transition count 4409
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2413 place count 4900 transition count 4400
Iterating global reduction 2 with 9 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4394
Deduced a syphon composed of 6 places in 18 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2434 place count 4894 transition count 4394
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 6 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6014 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6016 place count 3102 transition count 2602
Applied a total of 6016 rules in 1586 ms. Remains 3102 /6112 variables (removed 3010) and now considering 2602/5612 (removed 3010) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:33:47] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:33:50] [INFO ] Implicit Places using invariants in 2215 ms returned []
[2024-05-29 11:33:50] [INFO ] Invariant cache hit.
[2024-05-29 11:33:54] [INFO ] Implicit Places using invariants and state equation in 4533 ms returned []
Implicit Place search using SMT with State Equation took 6760 ms to find 0 implicit places.
[2024-05-29 11:33:54] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:33:54] [INFO ] Invariant cache hit.
[2024-05-29 11:33:56] [INFO ] Dead Transitions using invariants and state equation in 2078 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3102/6112 places, 2602/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10509 ms. Remains : 3102/6112 places, 2602/5612 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s916 0) (EQ s932 0)), p1:(EQ s403 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14 reset in 1681 ms.
Product exploration explored 100000 steps with 15 reset in 2162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71626 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71626 steps, saw 64481 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:34:04] [INFO ] Invariant cache hit.
[2024-05-29 11:34:04] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:34:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 11:34:07] [INFO ] After 1682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:34:07] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-05-29 11:34:07] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2024-05-29 11:34:07] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:34:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-05-29 11:34:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 774 ms
[2024-05-29 11:34:08] [INFO ] After 2678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-29 11:34:08] [INFO ] After 3600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 122 ms.
Support contains 3 out of 3102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3102 transition count 2602
Applied a total of 597 rules in 287 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 101091 steps, run timeout after 3006 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101091 steps, saw 99906 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:34:12] [INFO ] Computed 1101 invariants in 22 ms
[2024-05-29 11:34:12] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:34:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 226 ms returned sat
[2024-05-29 11:34:15] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:34:15] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 1 ms to minimize.
[2024-05-29 11:34:16] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2024-05-29 11:34:16] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2024-05-29 11:34:16] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 1 ms to minimize.
[2024-05-29 11:34:17] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2024-05-29 11:34:17] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2024-05-29 11:34:17] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 1 ms to minimize.
[2024-05-29 11:34:18] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2024-05-29 11:34:18] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-05-29 11:34:18] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 1 ms to minimize.
[2024-05-29 11:34:19] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:34:19] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 0 ms to minimize.
[2024-05-29 11:34:19] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2024-05-29 11:34:19] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 0 ms to minimize.
[2024-05-29 11:34:20] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2024-05-29 11:34:20] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 0 ms to minimize.
[2024-05-29 11:34:20] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2024-05-29 11:34:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2024-05-29 11:34:21] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2024-05-29 11:34:22] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:34:22] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6820 ms
[2024-05-29 11:34:22] [INFO ] After 8767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-29 11:34:22] [INFO ] After 9675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 3 out of 3102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 131 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 130 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2024-05-29 11:34:23] [INFO ] Invariant cache hit.
[2024-05-29 11:34:25] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2024-05-29 11:34:25] [INFO ] Invariant cache hit.
[2024-05-29 11:34:30] [INFO ] Implicit Places using invariants and state equation in 5174 ms returned []
Implicit Place search using SMT with State Equation took 7675 ms to find 0 implicit places.
[2024-05-29 11:34:30] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-29 11:34:30] [INFO ] Invariant cache hit.
[2024-05-29 11:34:32] [INFO ] Dead Transitions using invariants and state equation in 2151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10039 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 149 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 11:34:33] [INFO ] Invariant cache hit.
[2024-05-29 11:34:33] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:34:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 239 ms returned sat
[2024-05-29 11:34:35] [INFO ] After 1602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:34:36] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 1 ms to minimize.
[2024-05-29 11:34:36] [INFO ] Deduced a trap composed of 22 places in 305 ms of which 1 ms to minimize.
[2024-05-29 11:34:37] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 1 ms to minimize.
[2024-05-29 11:34:37] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 0 ms to minimize.
[2024-05-29 11:34:37] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 0 ms to minimize.
[2024-05-29 11:34:38] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 0 ms to minimize.
[2024-05-29 11:34:38] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 0 ms to minimize.
[2024-05-29 11:34:38] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 1 ms to minimize.
[2024-05-29 11:34:39] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 0 ms to minimize.
[2024-05-29 11:34:39] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 0 ms to minimize.
[2024-05-29 11:34:39] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2024-05-29 11:34:39] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2024-05-29 11:34:40] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2024-05-29 11:34:40] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2024-05-29 11:34:40] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2024-05-29 11:34:40] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 0 ms to minimize.
[2024-05-29 11:34:41] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2024-05-29 11:34:41] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2024-05-29 11:34:41] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:34:41] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-29 11:34:41] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 0 ms to minimize.
[2024-05-29 11:34:41] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2024-05-29 11:34:42] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6187 ms
[2024-05-29 11:34:42] [INFO ] After 8028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 181 ms.
[2024-05-29 11:34:42] [INFO ] After 8965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 151 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:34:43] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 11:34:45] [INFO ] Implicit Places using invariants in 2162 ms returned []
[2024-05-29 11:34:45] [INFO ] Invariant cache hit.
[2024-05-29 11:34:49] [INFO ] Implicit Places using invariants and state equation in 4399 ms returned []
Implicit Place search using SMT with State Equation took 6584 ms to find 0 implicit places.
[2024-05-29 11:34:49] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-29 11:34:49] [INFO ] Invariant cache hit.
[2024-05-29 11:34:51] [INFO ] Dead Transitions using invariants and state equation in 2010 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8827 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71797 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71797 steps, saw 64634 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:34:55] [INFO ] Invariant cache hit.
[2024-05-29 11:34:55] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:34:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 215 ms returned sat
[2024-05-29 11:34:58] [INFO ] After 1635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:34:58] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-29 11:34:58] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 11:34:58] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2024-05-29 11:34:58] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-29 11:34:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 785 ms
[2024-05-29 11:34:59] [INFO ] After 2651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-05-29 11:34:59] [INFO ] After 3545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 122 ms.
Support contains 3 out of 3102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3102 transition count 2602
Applied a total of 597 rules in 270 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98041 steps, run timeout after 3005 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98041 steps, saw 96871 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:35:03] [INFO ] Computed 1101 invariants in 28 ms
[2024-05-29 11:35:03] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:35:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 222 ms returned sat
[2024-05-29 11:35:06] [INFO ] After 1656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:35:06] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 1 ms to minimize.
[2024-05-29 11:35:07] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 1 ms to minimize.
[2024-05-29 11:35:07] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2024-05-29 11:35:07] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2024-05-29 11:35:08] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2024-05-29 11:35:08] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2024-05-29 11:35:08] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2024-05-29 11:35:09] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 0 ms to minimize.
[2024-05-29 11:35:09] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 0 ms to minimize.
[2024-05-29 11:35:09] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 0 ms to minimize.
[2024-05-29 11:35:09] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 0 ms to minimize.
[2024-05-29 11:35:10] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 1 ms to minimize.
[2024-05-29 11:35:10] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2024-05-29 11:35:10] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2024-05-29 11:35:11] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 0 ms to minimize.
[2024-05-29 11:35:11] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2024-05-29 11:35:11] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2024-05-29 11:35:11] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2024-05-29 11:35:11] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2024-05-29 11:35:12] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-29 11:35:12] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:35:12] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2024-05-29 11:35:12] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-05-29 11:35:12] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:35:12] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:35:13] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 0 ms to minimize.
[2024-05-29 11:35:13] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6905 ms
[2024-05-29 11:35:13] [INFO ] After 8791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-05-29 11:35:13] [INFO ] After 9687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 3102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 132 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 131 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2024-05-29 11:35:13] [INFO ] Invariant cache hit.
[2024-05-29 11:35:16] [INFO ] Implicit Places using invariants in 2553 ms returned []
[2024-05-29 11:35:16] [INFO ] Invariant cache hit.
[2024-05-29 11:35:22] [INFO ] Implicit Places using invariants and state equation in 5726 ms returned []
Implicit Place search using SMT with State Equation took 8280 ms to find 0 implicit places.
[2024-05-29 11:35:22] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-29 11:35:22] [INFO ] Invariant cache hit.
[2024-05-29 11:35:24] [INFO ] Dead Transitions using invariants and state equation in 2209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10711 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 144 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 11:35:24] [INFO ] Invariant cache hit.
[2024-05-29 11:35:25] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:35:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:35:27] [INFO ] After 1657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:35:27] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 1 ms to minimize.
[2024-05-29 11:35:28] [INFO ] Deduced a trap composed of 22 places in 324 ms of which 1 ms to minimize.
[2024-05-29 11:35:28] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 1 ms to minimize.
[2024-05-29 11:35:29] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2024-05-29 11:35:29] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2024-05-29 11:35:29] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 0 ms to minimize.
[2024-05-29 11:35:30] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2024-05-29 11:35:30] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 1 ms to minimize.
[2024-05-29 11:35:30] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2024-05-29 11:35:31] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2024-05-29 11:35:31] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2024-05-29 11:35:31] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2024-05-29 11:35:31] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 0 ms to minimize.
[2024-05-29 11:35:32] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2024-05-29 11:35:32] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2024-05-29 11:35:32] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2024-05-29 11:35:32] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2024-05-29 11:35:33] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2024-05-29 11:35:33] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-29 11:35:33] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-05-29 11:35:33] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2024-05-29 11:35:33] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2024-05-29 11:35:33] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6377 ms
[2024-05-29 11:35:34] [INFO ] After 8262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2024-05-29 11:35:34] [INFO ] After 9227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15 reset in 1691 ms.
Product exploration explored 100000 steps with 15 reset in 2212 ms.
Built C files in :
/tmp/ltsmin1065103496238283161
[2024-05-29 11:35:38] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:35:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1065103496238283161
Running compilation step : cd /tmp/ltsmin1065103496238283161;'/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/ltsmin1065103496238283161;'/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/ltsmin1065103496238283161;'/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 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 159 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:35:41] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 11:35:43] [INFO ] Implicit Places using invariants in 2133 ms returned []
[2024-05-29 11:35:43] [INFO ] Invariant cache hit.
[2024-05-29 11:35:48] [INFO ] Implicit Places using invariants and state equation in 4463 ms returned []
Implicit Place search using SMT with State Equation took 6616 ms to find 0 implicit places.
[2024-05-29 11:35:48] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:35:48] [INFO ] Invariant cache hit.
[2024-05-29 11:35:50] [INFO ] Dead Transitions using invariants and state equation in 2073 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8938 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin8446490291696208164
[2024-05-29 11:35:50] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:35:50] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8446490291696208164
Running compilation step : cd /tmp/ltsmin8446490291696208164;'/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/ltsmin8446490291696208164;'/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/ltsmin8446490291696208164;'/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 11:35:53] [INFO ] Flatten gal took : 97 ms
[2024-05-29 11:35:53] [INFO ] Flatten gal took : 83 ms
[2024-05-29 11:35:53] [INFO ] Time to serialize gal into /tmp/LTL14686074912369666828.gal : 11 ms
[2024-05-29 11:35:53] [INFO ] Time to serialize properties into /tmp/LTL4736134770096383833.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/LTL14686074912369666828.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1816158596733410678.hoa' '-atoms' '/tmp/LTL4736134770096383833.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/LTL4736134770096383833.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1816158596733410678.hoa
Detected timeout of ITS tools.
[2024-05-29 11:36:09] [INFO ] Flatten gal took : 67 ms
[2024-05-29 11:36:09] [INFO ] Flatten gal took : 67 ms
[2024-05-29 11:36:09] [INFO ] Time to serialize gal into /tmp/LTL14323969538259636394.gal : 10 ms
[2024-05-29 11:36:09] [INFO ] Time to serialize properties into /tmp/LTL17264234225371769304.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/LTL14323969538259636394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17264234225371769304.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p2074==0)||(p2107==0))")||(X(F("(p967==0)")))))))
Formula 0 simplified : G(F!"((p2074==0)||(p2107==0))" & FG!"(p967==0)")
Detected timeout of ITS tools.
[2024-05-29 11:36:24] [INFO ] Flatten gal took : 88 ms
[2024-05-29 11:36:24] [INFO ] Applying decomposition
[2024-05-29 11:36:24] [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/graph17349334955388460530.txt' '-o' '/tmp/graph17349334955388460530.bin' '-w' '/tmp/graph17349334955388460530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17349334955388460530.bin' '-l' '-1' '-v' '-w' '/tmp/graph17349334955388460530.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:36:24] [INFO ] Decomposing Gal with order
[2024-05-29 11:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:36:24] [INFO ] Removed a total of 601 redundant transitions.
[2024-05-29 11:36:24] [INFO ] Flatten gal took : 104 ms
[2024-05-29 11:36:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 26 ms.
[2024-05-29 11:36:25] [INFO ] Time to serialize gal into /tmp/LTL1896960739639207123.gal : 22 ms
[2024-05-29 11:36:25] [INFO ] Time to serialize properties into /tmp/LTL1413871145624891908.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/LTL1896960739639207123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1413871145624891908.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i16.i0.i1.u325.p2074==0)||(i16.i0.i0.u331.p2107==0))")||(X(F("(i7.u143.p967==0)")))))))
Formula 0 simplified : G(F!"((i16.i0.i1.u325.p2074==0)||(i16.i0.i0.u331.p2107==0))" & FG!"(i7.u143.p967==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15230490998654543678
[2024-05-29 11:36:40] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15230490998654543678
Running compilation step : cd /tmp/ltsmin15230490998654543678;'/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/ltsmin15230490998654543678;'/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/ltsmin15230490998654543678;'/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 ShieldPPPs-PT-100B-LTLFireability-11 finished in 176940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 2 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6103 transition count 5603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6103 transition count 5603
Applied a total of 18 rules in 1299 ms. Remains 6103 /6112 variables (removed 9) and now considering 5603/5612 (removed 9) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2024-05-29 11:36:44] [INFO ] Computed 1101 invariants in 26 ms
[2024-05-29 11:36:46] [INFO ] Implicit Places using invariants in 2463 ms returned []
[2024-05-29 11:36:47] [INFO ] Invariant cache hit.
[2024-05-29 11:36:49] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 4977 ms to find 0 implicit places.
[2024-05-29 11:36:49] [INFO ] Invariant cache hit.
[2024-05-29 11:36:53] [INFO ] Dead Transitions using invariants and state equation in 4465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6112 places, 5603/5612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10758 ms. Remains : 6103/6112 places, 5603/5612 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s143 1) (EQ s3537 1)), p0:(EQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 14967 steps with 0 reset in 253 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-12 finished in 11184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5409 transition count 4409
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4909 transition count 4409
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2414 place count 4899 transition count 4399
Iterating global reduction 2 with 10 rules applied. Total rules applied 2424 place count 4899 transition count 4399
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2424 place count 4899 transition count 4393
Deduced a syphon composed of 6 places in 18 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2436 place count 4893 transition count 4393
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 6 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6016 place count 3103 transition count 2603
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6018 place count 3101 transition count 2601
Applied a total of 6018 rules in 1603 ms. Remains 3101 /6112 variables (removed 3011) and now considering 2601/5612 (removed 3011) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:36:56] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 11:36:58] [INFO ] Implicit Places using invariants in 2122 ms returned []
[2024-05-29 11:36:58] [INFO ] Invariant cache hit.
[2024-05-29 11:37:02] [INFO ] Implicit Places using invariants and state equation in 4510 ms returned []
Implicit Place search using SMT with State Equation took 6663 ms to find 0 implicit places.
[2024-05-29 11:37:02] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:37:02] [INFO ] Invariant cache hit.
[2024-05-29 11:37:04] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6112 places, 2601/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10411 ms. Remains : 3101/6112 places, 2601/5612 transitions.
Stuttering acceptance computed with spot in 2424 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2491 1) (EQ s2502 1)), p1:(EQ s1705 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6577 steps with 0 reset in 111 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-13 finished in 12981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6111 transition count 4909
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5409 transition count 4909
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5409 transition count 4409
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4909 transition count 4409
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2413 place count 4900 transition count 4400
Iterating global reduction 2 with 9 rules applied. Total rules applied 2422 place count 4900 transition count 4400
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2422 place count 4900 transition count 4395
Deduced a syphon composed of 5 places in 19 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2432 place count 4895 transition count 4395
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 6 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 2 with 3580 rules applied. Total rules applied 6012 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6014 place count 3103 transition count 2603
Applied a total of 6014 rules in 1626 ms. Remains 3103 /6112 variables (removed 3009) and now considering 2603/5612 (removed 3009) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:37:09] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 11:37:11] [INFO ] Implicit Places using invariants in 2107 ms returned []
[2024-05-29 11:37:11] [INFO ] Invariant cache hit.
[2024-05-29 11:37:15] [INFO ] Implicit Places using invariants and state equation in 4489 ms returned []
Implicit Place search using SMT with State Equation took 6614 ms to find 0 implicit places.
[2024-05-29 11:37:15] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:37:15] [INFO ] Invariant cache hit.
[2024-05-29 11:37:17] [INFO ] Dead Transitions using invariants and state equation in 2071 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6112 places, 2603/5612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10389 ms. Remains : 3103/6112 places, 2603/5612 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s103 1) (EQ s757 1) (EQ s768 1)), p0:(NEQ s305 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]]
Entered a terminal (fully accepting) state of product in 5688 steps with 0 reset in 98 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-14 finished in 10605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&X(F(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-03
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6111 transition count 4911
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5411 transition count 4911
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5411 transition count 4411
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4911 transition count 4411
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2410 place count 4901 transition count 4401
Iterating global reduction 2 with 10 rules applied. Total rules applied 2420 place count 4901 transition count 4401
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2420 place count 4901 transition count 4395
Deduced a syphon composed of 6 places in 19 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2432 place count 4895 transition count 4395
Performed 1789 Post agglomeration using F-continuation condition.Transition count delta: 1789
Deduced a syphon composed of 1789 places in 9 ms
Reduce places removed 1789 places and 0 transitions.
Iterating global reduction 2 with 3578 rules applied. Total rules applied 6010 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6012 place count 3104 transition count 2604
Applied a total of 6012 rules in 1802 ms. Remains 3104 /6112 variables (removed 3008) and now considering 2604/5612 (removed 3008) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:37:20] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 11:37:22] [INFO ] Implicit Places using invariants in 2110 ms returned []
[2024-05-29 11:37:22] [INFO ] Invariant cache hit.
[2024-05-29 11:37:26] [INFO ] Implicit Places using invariants and state equation in 4573 ms returned []
Implicit Place search using SMT with State Equation took 6717 ms to find 0 implicit places.
[2024-05-29 11:37:26] [INFO ] Invariant cache hit.
[2024-05-29 11:37:28] [INFO ] Dead Transitions using invariants and state equation in 2071 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6112 places, 2604/5612 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10610 ms. Remains : 3104/6112 places, 2604/5612 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1000 0) (EQ s1022 0)), p1:(OR (EQ s1310 0) (EQ s1328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 1666 ms.
Product exploration explored 100000 steps with 53 reset in 2161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 77866 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77866 steps, saw 70551 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 11:37:36] [INFO ] Invariant cache hit.
[2024-05-29 11:37:37] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:37:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 228 ms returned sat
[2024-05-29 11:37:39] [INFO ] After 1709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:37:40] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2024-05-29 11:37:40] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2024-05-29 11:37:40] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2024-05-29 11:37:40] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-05-29 11:37:41] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2024-05-29 11:37:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-05-29 11:37:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1433 ms
[2024-05-29 11:37:42] [INFO ] After 3718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 363 ms.
[2024-05-29 11:37:42] [INFO ] After 4992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 318 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 89411 steps, run timeout after 3003 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89411 steps, saw 88297 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:37:46] [INFO ] Computed 1101 invariants in 24 ms
[2024-05-29 11:37:47] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:37:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 250 ms returned sat
[2024-05-29 11:37:50] [INFO ] After 1941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:37:50] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-29 11:37:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-29 11:37:50] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-05-29 11:37:51] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2024-05-29 11:37:51] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2024-05-29 11:37:51] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 11:37:51] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2024-05-29 11:37:51] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-05-29 11:37:51] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2024-05-29 11:37:52] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2024-05-29 11:37:52] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:37:52] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2024-05-29 11:37:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2323 ms
[2024-05-29 11:37:53] [INFO ] After 4839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 376 ms.
[2024-05-29 11:37:53] [INFO ] After 6207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 142 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 142 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:37:54] [INFO ] Invariant cache hit.
[2024-05-29 11:37:56] [INFO ] Implicit Places using invariants in 2440 ms returned []
[2024-05-29 11:37:56] [INFO ] Invariant cache hit.
[2024-05-29 11:38:01] [INFO ] Implicit Places using invariants and state equation in 5314 ms returned []
Implicit Place search using SMT with State Equation took 7765 ms to find 0 implicit places.
[2024-05-29 11:38:01] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-29 11:38:01] [INFO ] Invariant cache hit.
[2024-05-29 11:38:03] [INFO ] Dead Transitions using invariants and state equation in 2011 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10008 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 137 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 11:38:04] [INFO ] Invariant cache hit.
[2024-05-29 11:38:04] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:38:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 237 ms returned sat
[2024-05-29 11:38:07] [INFO ] After 1942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:38:07] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-29 11:38:07] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2024-05-29 11:38:08] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2024-05-29 11:38:08] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:38:08] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2024-05-29 11:38:08] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 11:38:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1061 ms
[2024-05-29 11:38:09] [INFO ] After 3587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-29 11:38:09] [INFO ] After 4925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 139 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:38:10] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:38:12] [INFO ] Implicit Places using invariants in 2225 ms returned []
[2024-05-29 11:38:12] [INFO ] Invariant cache hit.
[2024-05-29 11:38:17] [INFO ] Implicit Places using invariants and state equation in 4829 ms returned []
Implicit Place search using SMT with State Equation took 7060 ms to find 0 implicit places.
[2024-05-29 11:38:17] [INFO ] Invariant cache hit.
[2024-05-29 11:38:19] [INFO ] Dead Transitions using invariants and state equation in 1987 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9188 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 77 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 64175 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64175 steps, saw 58041 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 11:38:23] [INFO ] Invariant cache hit.
[2024-05-29 11:38:24] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:38:24] [INFO ] [Nat]Absence check using 1101 positive place invariants in 238 ms returned sat
[2024-05-29 11:38:26] [INFO ] After 1905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:38:27] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2024-05-29 11:38:27] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2024-05-29 11:38:27] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 0 ms to minimize.
[2024-05-29 11:38:27] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-29 11:38:28] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 11:38:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2024-05-29 11:38:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1436 ms
[2024-05-29 11:38:28] [INFO ] After 3906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 373 ms.
[2024-05-29 11:38:29] [INFO ] After 5195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 265 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 289 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 86377 steps, run timeout after 3004 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86377 steps, saw 85279 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:38:33] [INFO ] Computed 1101 invariants in 31 ms
[2024-05-29 11:38:34] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:38:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 237 ms returned sat
[2024-05-29 11:38:37] [INFO ] After 1895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:38:37] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-05-29 11:38:37] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2024-05-29 11:38:37] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-05-29 11:38:37] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2024-05-29 11:38:38] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-29 11:38:38] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:38:38] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-05-29 11:38:38] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-29 11:38:38] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2024-05-29 11:38:38] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-29 11:38:39] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2024-05-29 11:38:39] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2024-05-29 11:38:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2339 ms
[2024-05-29 11:38:39] [INFO ] After 4810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 374 ms.
[2024-05-29 11:38:40] [INFO ] After 6105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 138 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 142 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:38:40] [INFO ] Invariant cache hit.
[2024-05-29 11:38:43] [INFO ] Implicit Places using invariants in 2631 ms returned []
[2024-05-29 11:38:43] [INFO ] Invariant cache hit.
[2024-05-29 11:38:48] [INFO ] Implicit Places using invariants and state equation in 5364 ms returned []
Implicit Place search using SMT with State Equation took 7995 ms to find 0 implicit places.
[2024-05-29 11:38:48] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-29 11:38:48] [INFO ] Invariant cache hit.
[2024-05-29 11:38:51] [INFO ] Dead Transitions using invariants and state equation in 2223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10454 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 155 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 11:38:51] [INFO ] Invariant cache hit.
[2024-05-29 11:38:51] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:38:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 216 ms returned sat
[2024-05-29 11:38:54] [INFO ] After 1887ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:38:54] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2024-05-29 11:38:55] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-05-29 11:38:55] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 11:38:55] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:38:55] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2024-05-29 11:38:55] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 11:38:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1184 ms
[2024-05-29 11:38:56] [INFO ] After 3632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 375 ms.
[2024-05-29 11:38:56] [INFO ] After 4913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 56 reset in 1717 ms.
Product exploration explored 100000 steps with 55 reset in 2177 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 144 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:39:01] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:39:01] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 11:39:03] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2358 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin14266420376394909625
[2024-05-29 11:39:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14266420376394909625
Running compilation step : cd /tmp/ltsmin14266420376394909625;'/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/ltsmin14266420376394909625;'/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/ltsmin14266420376394909625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 140 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:39:06] [INFO ] Invariant cache hit.
[2024-05-29 11:39:09] [INFO ] Implicit Places using invariants in 2158 ms returned []
[2024-05-29 11:39:09] [INFO ] Invariant cache hit.
[2024-05-29 11:39:13] [INFO ] Implicit Places using invariants and state equation in 4435 ms returned []
Implicit Place search using SMT with State Equation took 6625 ms to find 0 implicit places.
[2024-05-29 11:39:13] [INFO ] Invariant cache hit.
[2024-05-29 11:39:15] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8881 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin6669561768017611740
[2024-05-29 11:39:15] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6669561768017611740
Running compilation step : cd /tmp/ltsmin6669561768017611740;'/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/ltsmin6669561768017611740;'/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/ltsmin6669561768017611740;'/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 11:39:18] [INFO ] Flatten gal took : 69 ms
[2024-05-29 11:39:19] [INFO ] Flatten gal took : 72 ms
[2024-05-29 11:39:19] [INFO ] Time to serialize gal into /tmp/LTL9549023497521327671.gal : 11 ms
[2024-05-29 11:39:19] [INFO ] Time to serialize properties into /tmp/LTL9291071806715614846.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/LTL9549023497521327671.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2367805482923718851.hoa' '-atoms' '/tmp/LTL9291071806715614846.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9291071806715614846.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2367805482923718851.hoa
Detected timeout of ITS tools.
[2024-05-29 11:39:34] [INFO ] Flatten gal took : 71 ms
[2024-05-29 11:39:34] [INFO ] Flatten gal took : 72 ms
[2024-05-29 11:39:34] [INFO ] Time to serialize gal into /tmp/LTL12661196686811528247.gal : 12 ms
[2024-05-29 11:39:34] [INFO ] Time to serialize properties into /tmp/LTL672214956702130563.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/LTL12661196686811528247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL672214956702130563.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p2931==0)||(p2956==0))"))&&(X(F("((p2263==0)||(p2300==0))"))))&&("((p2263==0)||(p2300==0))")))))
Formula 0 simplified : XG(!"((p2263==0)||(p2300==0))" | F!"((p2931==0)||(p2956==0))" | XG!"((p2263==0)||(p2300==0))")
Detected timeout of ITS tools.
[2024-05-29 11:39:49] [INFO ] Flatten gal took : 69 ms
[2024-05-29 11:39:49] [INFO ] Applying decomposition
[2024-05-29 11:39:49] [INFO ] Flatten gal took : 70 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/graph10131705623307921812.txt' '-o' '/tmp/graph10131705623307921812.bin' '-w' '/tmp/graph10131705623307921812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10131705623307921812.bin' '-l' '-1' '-v' '-w' '/tmp/graph10131705623307921812.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:39:49] [INFO ] Decomposing Gal with order
[2024-05-29 11:39:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:39:50] [INFO ] Removed a total of 605 redundant transitions.
[2024-05-29 11:39:50] [INFO ] Flatten gal took : 104 ms
[2024-05-29 11:39:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1192 labels/synchronizations in 32 ms.
[2024-05-29 11:39:50] [INFO ] Time to serialize gal into /tmp/LTL18385626493997367561.gal : 39 ms
[2024-05-29 11:39:50] [INFO ] Time to serialize properties into /tmp/LTL16271412461417620501.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/LTL18385626493997367561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16271412461417620501.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(((G("((i23.u467.p2931==0)||(i23.u473.p2956==0))"))&&(X(F("((i17.u356.p2263==0)||(i17.u363.p2300==0))"))))&&("((i17.u356.p2263==...185
Formula 0 simplified : XG(!"((i17.u356.p2263==0)||(i17.u363.p2300==0))" | F!"((i23.u467.p2931==0)||(i23.u473.p2956==0))" | XG!"((i17.u356.p2263==0)||(i17.u...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16383114293401675071
[2024-05-29 11:40:05] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16383114293401675071
Running compilation step : cd /tmp/ltsmin16383114293401675071;'/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/ltsmin16383114293401675071;'/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/ltsmin16383114293401675071;'/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 ShieldPPPs-PT-100B-LTLFireability-03 finished in 170407 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&&X(p2))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-06
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6111 transition count 4910
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5410 transition count 4910
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5410 transition count 4411
Deduced a syphon composed of 499 places in 20 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4911 transition count 4411
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2410 place count 4901 transition count 4401
Iterating global reduction 2 with 10 rules applied. Total rules applied 2420 place count 4901 transition count 4401
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2420 place count 4901 transition count 4395
Deduced a syphon composed of 6 places in 19 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2432 place count 4895 transition count 4395
Performed 1788 Post agglomeration using F-continuation condition.Transition count delta: 1788
Deduced a syphon composed of 1788 places in 6 ms
Reduce places removed 1788 places and 0 transitions.
Iterating global reduction 2 with 3576 rules applied. Total rules applied 6008 place count 3107 transition count 2607
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6010 place count 3105 transition count 2605
Applied a total of 6010 rules in 1712 ms. Remains 3105 /6112 variables (removed 3007) and now considering 2605/5612 (removed 3007) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:40:10] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:40:12] [INFO ] Implicit Places using invariants in 2072 ms returned []
[2024-05-29 11:40:12] [INFO ] Invariant cache hit.
[2024-05-29 11:40:16] [INFO ] Implicit Places using invariants and state equation in 4461 ms returned []
Implicit Place search using SMT with State Equation took 6550 ms to find 0 implicit places.
[2024-05-29 11:40:16] [INFO ] Invariant cache hit.
[2024-05-29 11:40:18] [INFO ] Dead Transitions using invariants and state equation in 2029 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3105/6112 places, 2605/5612 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10297 ms. Remains : 3105/6112 places, 2605/5612 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1255 0) (EQ s1275 0)), p1:(OR (EQ s2145 0) (EQ s925 0)), p2:(EQ s2145 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1728 ms.
Product exploration explored 100000 steps with 20 reset in 2242 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 482 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 11:40:24] [INFO ] Invariant cache hit.
[2024-05-29 11:40:25] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:40:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 253 ms returned sat
[2024-05-29 11:40:27] [INFO ] After 1795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:40:27] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2024-05-29 11:40:28] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:40:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2024-05-29 11:40:28] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:40:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-29 11:40:28] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:40:29] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:40:29] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:40:29] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:40:29] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:40:29] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2024-05-29 11:40:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1064 ms
[2024-05-29 11:40:29] [INFO ] After 3918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 383 ms.
[2024-05-29 11:40:30] [INFO ] After 5271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 283 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 88263 steps, run timeout after 3003 ms. (steps per millisecond=29 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 88263 steps, saw 86894 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:40:34] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 11:40:35] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:40:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 257 ms returned sat
[2024-05-29 11:40:37] [INFO ] After 1772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:40:37] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-29 11:40:38] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 11:40:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:40:38] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:40:38] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 11:40:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1044 ms
[2024-05-29 11:40:39] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 11:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-29 11:40:39] [INFO ] After 3233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2024-05-29 11:40:39] [INFO ] After 4237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 108 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 151 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96711 steps, run timeout after 3008 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96711 steps, saw 95299 distinct states, run finished after 3008 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:40:43] [INFO ] Invariant cache hit.
[2024-05-29 11:40:43] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:40:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:40:46] [INFO ] After 1757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:40:46] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 0 ms to minimize.
[2024-05-29 11:40:47] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2024-05-29 11:40:47] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 0 ms to minimize.
[2024-05-29 11:40:47] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 0 ms to minimize.
[2024-05-29 11:40:47] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 0 ms to minimize.
[2024-05-29 11:40:48] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 0 ms to minimize.
[2024-05-29 11:40:48] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2024-05-29 11:40:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-29 11:40:48] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2024-05-29 11:40:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2531 ms
[2024-05-29 11:40:49] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2024-05-29 11:40:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-29 11:40:49] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-29 11:40:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:40:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 747 ms
[2024-05-29 11:40:49] [INFO ] After 5182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 195 ms.
[2024-05-29 11:40:49] [INFO ] After 6155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 142 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 140 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2024-05-29 11:40:50] [INFO ] Invariant cache hit.
[2024-05-29 11:40:52] [INFO ] Implicit Places using invariants in 2641 ms returned []
[2024-05-29 11:40:52] [INFO ] Invariant cache hit.
[2024-05-29 11:40:58] [INFO ] Implicit Places using invariants and state equation in 5291 ms returned []
Implicit Place search using SMT with State Equation took 7934 ms to find 0 implicit places.
[2024-05-29 11:40:58] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-29 11:40:58] [INFO ] Invariant cache hit.
[2024-05-29 11:41:00] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10097 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 134 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 11:41:00] [INFO ] Invariant cache hit.
[2024-05-29 11:41:00] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:41:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 256 ms returned sat
[2024-05-29 11:41:03] [INFO ] After 1722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:41:03] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 0 ms to minimize.
[2024-05-29 11:41:03] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2024-05-29 11:41:04] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2024-05-29 11:41:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2477 ms
[2024-05-29 11:41:05] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:41:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 789 ms
[2024-05-29 11:41:06] [INFO ] After 5125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2024-05-29 11:41:06] [INFO ] After 6111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 771 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 151 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:41:08] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 11:41:10] [INFO ] Implicit Places using invariants in 2294 ms returned []
[2024-05-29 11:41:10] [INFO ] Invariant cache hit.
[2024-05-29 11:41:15] [INFO ] Implicit Places using invariants and state equation in 4946 ms returned []
Implicit Place search using SMT with State Equation took 7245 ms to find 0 implicit places.
[2024-05-29 11:41:15] [INFO ] Invariant cache hit.
[2024-05-29 11:41:17] [INFO ] Dead Transitions using invariants and state equation in 2229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9627 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 456 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 11:41:19] [INFO ] Invariant cache hit.
[2024-05-29 11:41:19] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 11:41:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 247 ms returned sat
[2024-05-29 11:41:22] [INFO ] After 1832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 11:41:22] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-29 11:41:22] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:41:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2024-05-29 11:41:23] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-29 11:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-29 11:41:23] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-29 11:41:23] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:41:23] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-05-29 11:41:24] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-29 11:41:24] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 11:41:24] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2024-05-29 11:41:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1044 ms
[2024-05-29 11:41:24] [INFO ] After 3939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 385 ms.
[2024-05-29 11:41:24] [INFO ] After 5298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 242 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 299 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 83915 steps, run timeout after 3003 ms. (steps per millisecond=27 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 83915 steps, saw 82570 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:41:29] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 11:41:29] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:41:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 237 ms returned sat
[2024-05-29 11:41:32] [INFO ] After 1664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:41:32] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2024-05-29 11:41:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 11:41:32] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-29 11:41:32] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:41:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-29 11:41:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 890 ms
[2024-05-29 11:41:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-29 11:41:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-29 11:41:33] [INFO ] After 2931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2024-05-29 11:41:33] [INFO ] After 3898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 117 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 156 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 104732 steps, run timeout after 3008 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104732 steps, saw 103281 distinct states, run finished after 3008 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:41:37] [INFO ] Invariant cache hit.
[2024-05-29 11:41:38] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:41:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 248 ms returned sat
[2024-05-29 11:41:40] [INFO ] After 1749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:41:40] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2024-05-29 11:41:41] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 0 ms to minimize.
[2024-05-29 11:41:41] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2024-05-29 11:41:41] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2024-05-29 11:41:42] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 0 ms to minimize.
[2024-05-29 11:41:42] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 4 ms to minimize.
[2024-05-29 11:41:42] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2024-05-29 11:41:42] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-29 11:41:42] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-29 11:41:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2381 ms
[2024-05-29 11:41:43] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:41:43] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2024-05-29 11:41:43] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:41:43] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2024-05-29 11:41:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 750 ms
[2024-05-29 11:41:43] [INFO ] After 5031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-29 11:41:44] [INFO ] After 6001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 103 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 145 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 138 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2024-05-29 11:41:44] [INFO ] Invariant cache hit.
[2024-05-29 11:41:47] [INFO ] Implicit Places using invariants in 2689 ms returned []
[2024-05-29 11:41:47] [INFO ] Invariant cache hit.
[2024-05-29 11:41:52] [INFO ] Implicit Places using invariants and state equation in 5580 ms returned []
Implicit Place search using SMT with State Equation took 8269 ms to find 0 implicit places.
[2024-05-29 11:41:52] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-29 11:41:52] [INFO ] Invariant cache hit.
[2024-05-29 11:41:55] [INFO ] Dead Transitions using invariants and state equation in 2199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10692 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 141 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 11:41:55] [INFO ] Invariant cache hit.
[2024-05-29 11:41:55] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:41:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 239 ms returned sat
[2024-05-29 11:41:58] [INFO ] After 1671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:41:58] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 0 ms to minimize.
[2024-05-29 11:41:58] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-05-29 11:41:58] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2024-05-29 11:41:59] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2024-05-29 11:41:59] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2024-05-29 11:41:59] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2024-05-29 11:41:59] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2024-05-29 11:42:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2024-05-29 11:42:00] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-29 11:42:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2327 ms
[2024-05-29 11:42:00] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:42:00] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:42:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 11:42:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2024-05-29 11:42:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 761 ms
[2024-05-29 11:42:01] [INFO ] After 4900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2024-05-29 11:42:01] [INFO ] After 5873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 718 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 19 reset in 1898 ms.
Product exploration explored 100000 steps with 19 reset in 2471 ms.
Built C files in :
/tmp/ltsmin13963606612045156024
[2024-05-29 11:42:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13963606612045156024
Running compilation step : cd /tmp/ltsmin13963606612045156024;'/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/ltsmin13963606612045156024;'/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/ltsmin13963606612045156024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 139 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2024-05-29 11:42:10] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 11:42:12] [INFO ] Implicit Places using invariants in 2280 ms returned []
[2024-05-29 11:42:12] [INFO ] Invariant cache hit.
[2024-05-29 11:42:17] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 7105 ms to find 0 implicit places.
[2024-05-29 11:42:17] [INFO ] Invariant cache hit.
[2024-05-29 11:42:19] [INFO ] Dead Transitions using invariants and state equation in 1964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9208 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Built C files in :
/tmp/ltsmin15482647146751783709
[2024-05-29 11:42:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15482647146751783709
Running compilation step : cd /tmp/ltsmin15482647146751783709;'/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/ltsmin15482647146751783709;'/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/ltsmin15482647146751783709;'/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 11:42:22] [INFO ] Flatten gal took : 83 ms
[2024-05-29 11:42:22] [INFO ] Flatten gal took : 76 ms
[2024-05-29 11:42:22] [INFO ] Time to serialize gal into /tmp/LTL9200893259315651089.gal : 11 ms
[2024-05-29 11:42:22] [INFO ] Time to serialize properties into /tmp/LTL5556530253377870203.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/LTL9200893259315651089.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7747907866126735032.hoa' '-atoms' '/tmp/LTL5556530253377870203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5556530253377870203.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7747907866126735032.hoa
Detected timeout of ITS tools.
[2024-05-29 11:42:37] [INFO ] Flatten gal took : 73 ms
[2024-05-29 11:42:37] [INFO ] Flatten gal took : 74 ms
[2024-05-29 11:42:37] [INFO ] Time to serialize gal into /tmp/LTL13827180623096159303.gal : 11 ms
[2024-05-29 11:42:37] [INFO ] Time to serialize properties into /tmp/LTL1553924222890885166.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/LTL13827180623096159303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1553924222890885166.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p2806==0)||(p2846==0))"))||((X("(p4724==0)"))&&("((p4724==0)||(p2092==0))"))))))
Formula 0 simplified : G(F!"((p2806==0)||(p2846==0))" & FG(!"((p4724==0)||(p2092==0))" | X!"(p4724==0)"))
Detected timeout of ITS tools.
[2024-05-29 11:42:53] [INFO ] Flatten gal took : 76 ms
[2024-05-29 11:42:53] [INFO ] Applying decomposition
[2024-05-29 11:42:53] [INFO ] Flatten gal took : 78 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/graph1304712683301345950.txt' '-o' '/tmp/graph1304712683301345950.bin' '-w' '/tmp/graph1304712683301345950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1304712683301345950.bin' '-l' '-1' '-v' '-w' '/tmp/graph1304712683301345950.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:42:53] [INFO ] Decomposing Gal with order
[2024-05-29 11:42:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:42:53] [INFO ] Removed a total of 604 redundant transitions.
[2024-05-29 11:42:53] [INFO ] Flatten gal took : 106 ms
[2024-05-29 11:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 24 ms.
[2024-05-29 11:42:53] [INFO ] Time to serialize gal into /tmp/LTL1541015060844541692.gal : 25 ms
[2024-05-29 11:42:53] [INFO ] Time to serialize properties into /tmp/LTL7663557406213214792.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/LTL1541015060844541692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7663557406213214792.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i23.i0.i1.u446.p2806==0)||(i23.i0.i2.u452.p2846==0))"))||((X("(i39.u761.p4724==0)"))&&("((i39.u761.p4724==0)||(i16.u329.p...171
Formula 0 simplified : G(F!"((i23.i0.i1.u446.p2806==0)||(i23.i0.i2.u452.p2846==0))" & FG(!"((i39.u761.p4724==0)||(i16.u329.p2092==0))" | X!"(i39.u761.p4724...162
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8174517596142481557
[2024-05-29 11:43:08] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8174517596142481557
Running compilation step : cd /tmp/ltsmin8174517596142481557;'/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/ltsmin8174517596142481557;'/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/ltsmin8174517596142481557;'/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 ShieldPPPs-PT-100B-LTLFireability-06 finished in 183561 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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-07
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 6112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6112/6112 places, 5612/5612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6111 transition count 4910
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5410 transition count 4910
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5410 transition count 4410
Deduced a syphon composed of 500 places in 32 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2402 place count 4910 transition count 4410
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2411 place count 4901 transition count 4401
Iterating global reduction 2 with 9 rules applied. Total rules applied 2420 place count 4901 transition count 4401
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2420 place count 4901 transition count 4396
Deduced a syphon composed of 5 places in 20 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2430 place count 4896 transition count 4396
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 7 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 6014 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6016 place count 3102 transition count 2602
Applied a total of 6016 rules in 1719 ms. Remains 3102 /6112 variables (removed 3010) and now considering 2602/5612 (removed 3010) transitions.
// Phase 1: matrix 2602 rows 3102 cols
[2024-05-29 11:43:13] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:43:16] [INFO ] Implicit Places using invariants in 2141 ms returned []
[2024-05-29 11:43:16] [INFO ] Invariant cache hit.
[2024-05-29 11:43:20] [INFO ] Implicit Places using invariants and state equation in 4726 ms returned []
Implicit Place search using SMT with State Equation took 6870 ms to find 0 implicit places.
[2024-05-29 11:43:20] [INFO ] Invariant cache hit.
[2024-05-29 11:43:23] [INFO ] Dead Transitions using invariants and state equation in 2324 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3102/6112 places, 2602/5612 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10916 ms. Remains : 3102/6112 places, 2602/5612 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-07 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 s499 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22224 reset in 1865 ms.
Product exploration explored 100000 steps with 22059 reset in 2239 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/3102 stabilizing places and 2/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-29 11:43:27] [INFO ] Invariant cache hit.
[2024-05-29 11:43:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 1635 ms returned sat
[2024-05-29 11:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:43:42] [INFO ] [Real]Absence check using state equation in 9525 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 180 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2024-05-29 11:43:43] [INFO ] Invariant cache hit.
[2024-05-29 11:43:45] [INFO ] Implicit Places using invariants in 2302 ms returned []
[2024-05-29 11:43:45] [INFO ] Invariant cache hit.
[2024-05-29 11:43:50] [INFO ] Implicit Places using invariants and state equation in 4960 ms returned []
Implicit Place search using SMT with State Equation took 7263 ms to find 0 implicit places.
[2024-05-29 11:43:50] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-29 11:43:50] [INFO ] Invariant cache hit.
[2024-05-29 11:43:52] [INFO ] Dead Transitions using invariants and state equation in 2263 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9788 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/3102 stabilizing places and 2/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-29 11:43:53] [INFO ] Invariant cache hit.
[2024-05-29 11:43:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 1750 ms returned sat
[2024-05-29 11:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:44:08] [INFO ] [Real]Absence check using state equation in 9693 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22007 reset in 1866 ms.
Product exploration explored 100000 steps with 22170 reset in 2179 ms.
Built C files in :
/tmp/ltsmin5018610691849527105
[2024-05-29 11:44:12] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:44:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5018610691849527105
Running compilation step : cd /tmp/ltsmin5018610691849527105;'/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/ltsmin5018610691849527105;'/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/ltsmin5018610691849527105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 2602/2602 transitions.
Applied a total of 0 rules in 147 ms. Remains 3102 /3102 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2024-05-29 11:44:15] [INFO ] Invariant cache hit.
[2024-05-29 11:44:17] [INFO ] Implicit Places using invariants in 2147 ms returned []
[2024-05-29 11:44:17] [INFO ] Invariant cache hit.
[2024-05-29 11:44:22] [INFO ] Implicit Places using invariants and state equation in 4777 ms returned []
Implicit Place search using SMT with State Equation took 6926 ms to find 0 implicit places.
[2024-05-29 11:44:22] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-29 11:44:22] [INFO ] Invariant cache hit.
[2024-05-29 11:44:24] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9282 ms. Remains : 3102/3102 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin12394005939663503336
[2024-05-29 11:44:24] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:44:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12394005939663503336
Running compilation step : cd /tmp/ltsmin12394005939663503336;'/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/ltsmin12394005939663503336;'/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/ltsmin12394005939663503336;'/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 11:44:27] [INFO ] Flatten gal took : 67 ms
[2024-05-29 11:44:27] [INFO ] Flatten gal took : 66 ms
[2024-05-29 11:44:27] [INFO ] Time to serialize gal into /tmp/LTL5240017606863789673.gal : 10 ms
[2024-05-29 11:44:27] [INFO ] Time to serialize properties into /tmp/LTL7707896961413525821.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/LTL5240017606863789673.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1383879841905118002.hoa' '-atoms' '/tmp/LTL7707896961413525821.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7707896961413525821.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1383879841905118002.hoa
Detected timeout of ITS tools.
[2024-05-29 11:44:43] [INFO ] Flatten gal took : 66 ms
[2024-05-29 11:44:43] [INFO ] Flatten gal took : 79 ms
[2024-05-29 11:44:43] [INFO ] Time to serialize gal into /tmp/LTL582814256738028251.gal : 11 ms
[2024-05-29 11:44:43] [INFO ] Time to serialize properties into /tmp/LTL8943367408990460248.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/LTL582814256738028251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8943367408990460248.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("(p1174==1)"))))
Formula 0 simplified : XG!"(p1174==1)"
Detected timeout of ITS tools.
[2024-05-29 11:44:58] [INFO ] Flatten gal took : 68 ms
[2024-05-29 11:44:58] [INFO ] Applying decomposition
[2024-05-29 11:44:58] [INFO ] Flatten gal took : 67 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/graph17957508229529287601.txt' '-o' '/tmp/graph17957508229529287601.bin' '-w' '/tmp/graph17957508229529287601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17957508229529287601.bin' '-l' '-1' '-v' '-w' '/tmp/graph17957508229529287601.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:44:58] [INFO ] Decomposing Gal with order
[2024-05-29 11:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:44:58] [INFO ] Removed a total of 601 redundant transitions.
[2024-05-29 11:44:58] [INFO ] Flatten gal took : 117 ms
[2024-05-29 11:44:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 18 ms.
[2024-05-29 11:44:59] [INFO ] Time to serialize gal into /tmp/LTL4240665797628998698.gal : 26 ms
[2024-05-29 11:44:59] [INFO ] Time to serialize properties into /tmp/LTL4547420463583117143.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4240665797628998698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4547420463583117143.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("(i7.i1.i2.u177.p1174==1)"))))
Formula 0 simplified : XG!"(i7.i1.i2.u177.p1174==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12947822606670855760
[2024-05-29 11:45:14] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12947822606670855760
Running compilation step : cd /tmp/ltsmin12947822606670855760;'/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/ltsmin12947822606670855760;'/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/ltsmin12947822606670855760;'/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 ShieldPPPs-PT-100B-LTLFireability-07 finished in 125216 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)))'
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((X(F(p1))||p0))))'
[2024-05-29 11:45:17] [INFO ] Flatten gal took : 134 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12735825465786010008
[2024-05-29 11:45:17] [INFO ] Too many transitions (5612) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:45:17] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12735825465786010008
Running compilation step : cd /tmp/ltsmin12735825465786010008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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 11:45:17] [INFO ] Applying decomposition
[2024-05-29 11:45:17] [INFO ] Flatten gal took : 159 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/graph7209523219057059516.txt' '-o' '/tmp/graph7209523219057059516.bin' '-w' '/tmp/graph7209523219057059516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7209523219057059516.bin' '-l' '-1' '-v' '-w' '/tmp/graph7209523219057059516.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:45:18] [INFO ] Decomposing Gal with order
[2024-05-29 11:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:45:20] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-29 11:45:20] [INFO ] Flatten gal took : 262 ms
[2024-05-29 11:45:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-29 11:45:20] [INFO ] Time to serialize gal into /tmp/LTLFireability10770779728036526485.gal : 35 ms
[2024-05-29 11:45:20] [INFO ] Time to serialize properties into /tmp/LTLFireability11485749462621196772.ltl : 30 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/LTLFireability10770779728036526485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11485749462621196772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 5 LTL properties
Checking formula 0 : !((X(F((("((i22.u806.p2263==0)||(i22.u819.p2300==0))")&&(G("((i29.u1041.p2931==0)||(i29.u1050.p2956==0))")))&&(X(F("((i22.u806.p2263==...187
Formula 0 simplified : XG(!"((i22.u806.p2263==0)||(i22.u819.p2300==0))" | F!"((i29.u1041.p2931==0)||(i29.u1050.p2956==0))" | XG!"((i22.u806.p2263==0)||(i22...173
Compilation finished in 22771 ms.
Running link step : cd /tmp/ltsmin12735825465786010008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 352 ms.
Running LTSmin : cd /tmp/ltsmin12735825465786010008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))&&X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin12735825465786010008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))&&X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12735825465786010008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin12735825465786010008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12735825465786010008;'/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(<>((LTLAPp5==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135804 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12470524 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldPPPs-PT-100B"
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 ShieldPPPs-PT-100B, 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-171683789000328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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