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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 2.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 17K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 11:47 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 888K 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-050B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716979201193

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-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 10:40:03] [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 10:40:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:40:03] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-29 10:40:03] [INFO ] Transformed 3403 places.
[2024-05-29 10:40:03] [INFO ] Transformed 3153 transitions.
[2024-05-29 10:40:03] [INFO ] Found NUPN structural information;
[2024-05-29 10:40:03] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 430 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-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 343 places :
Symmetric choice reduction at 0 with 343 rule applications. Total rules 343 place count 3060 transition count 2810
Iterating global reduction 0 with 343 rules applied. Total rules applied 686 place count 3060 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 687 place count 3059 transition count 2809
Iterating global reduction 0 with 1 rules applied. Total rules applied 688 place count 3059 transition count 2809
Applied a total of 688 rules in 1104 ms. Remains 3059 /3403 variables (removed 344) and now considering 2809/3153 (removed 344) transitions.
// Phase 1: matrix 2809 rows 3059 cols
[2024-05-29 10:40:05] [INFO ] Computed 551 invariants in 50 ms
[2024-05-29 10:40:06] [INFO ] Implicit Places using invariants in 1597 ms returned []
[2024-05-29 10:40:06] [INFO ] Invariant cache hit.
[2024-05-29 10:40:10] [INFO ] Implicit Places using invariants and state equation in 4110 ms returned []
Implicit Place search using SMT with State Equation took 5829 ms to find 0 implicit places.
[2024-05-29 10:40:10] [INFO ] Invariant cache hit.
[2024-05-29 10:40:13] [INFO ] Dead Transitions using invariants and state equation in 2407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3059/3403 places, 2809/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9354 ms. Remains : 3059/3403 places, 2809/3153 transitions.
Support contains 53 out of 3059 places after structural reductions.
[2024-05-29 10:40:13] [INFO ] Flatten gal took : 212 ms
[2024-05-29 10:40:13] [INFO ] Flatten gal took : 136 ms
[2024-05-29 10:40:13] [INFO ] Input system was already deterministic with 2809 transitions.
Support contains 47 out of 3059 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 33) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2024-05-29 10:40:14] [INFO ] Invariant cache hit.
[2024-05-29 10:40:16] [INFO ] [Real]Absence check using 551 positive place invariants in 257 ms returned sat
[2024-05-29 10:40:16] [INFO ] After 1821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-29 10:40:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 238 ms returned sat
[2024-05-29 10:40:22] [INFO ] After 3404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-29 10:40:23] [INFO ] Deduced a trap composed of 20 places in 938 ms of which 9 ms to minimize.
[2024-05-29 10:40:24] [INFO ] Deduced a trap composed of 24 places in 951 ms of which 3 ms to minimize.
[2024-05-29 10:40:25] [INFO ] Deduced a trap composed of 18 places in 882 ms of which 3 ms to minimize.
[2024-05-29 10:40:26] [INFO ] Deduced a trap composed of 36 places in 855 ms of which 4 ms to minimize.
[2024-05-29 10:40:27] [INFO ] Deduced a trap composed of 28 places in 872 ms of which 2 ms to minimize.
[2024-05-29 10:40:28] [INFO ] Deduced a trap composed of 22 places in 867 ms of which 1 ms to minimize.
[2024-05-29 10:40:29] [INFO ] Deduced a trap composed of 23 places in 857 ms of which 16 ms to minimize.
[2024-05-29 10:40:30] [INFO ] Deduced a trap composed of 17 places in 843 ms of which 2 ms to minimize.
[2024-05-29 10:40:31] [INFO ] Deduced a trap composed of 24 places in 837 ms of which 2 ms to minimize.
[2024-05-29 10:40:32] [INFO ] Deduced a trap composed of 24 places in 833 ms of which 2 ms to minimize.
[2024-05-29 10:40:33] [INFO ] Deduced a trap composed of 25 places in 860 ms of which 2 ms to minimize.
[2024-05-29 10:40:33] [INFO ] Deduced a trap composed of 17 places in 820 ms of which 2 ms to minimize.
[2024-05-29 10:40:34] [INFO ] Deduced a trap composed of 26 places in 821 ms of which 2 ms to minimize.
[2024-05-29 10:40:35] [INFO ] Deduced a trap composed of 29 places in 821 ms of which 2 ms to minimize.
[2024-05-29 10:40:36] [INFO ] Deduced a trap composed of 25 places in 795 ms of which 2 ms to minimize.
[2024-05-29 10:40:37] [INFO ] Deduced a trap composed of 10 places in 802 ms of which 4 ms to minimize.
[2024-05-29 10:40:38] [INFO ] Deduced a trap composed of 37 places in 861 ms of which 2 ms to minimize.
[2024-05-29 10:40:39] [INFO ] Deduced a trap composed of 24 places in 840 ms of which 3 ms to minimize.
[2024-05-29 10:40:40] [INFO ] Deduced a trap composed of 46 places in 845 ms of which 2 ms to minimize.
[2024-05-29 10:40:41] [INFO ] Deduced a trap composed of 26 places in 836 ms of which 2 ms to minimize.
[2024-05-29 10:40:42] [INFO ] Deduced a trap composed of 36 places in 796 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 10:40:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:40:42] [INFO ] After 25536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2352 ms.
Support contains 27 out of 3059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3059 transition count 2464
Reduce places removed 345 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 348 rules applied. Total rules applied 693 place count 2714 transition count 2461
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 696 place count 2711 transition count 2461
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 696 place count 2711 transition count 2209
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1200 place count 2459 transition count 2209
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1203 place count 2456 transition count 2206
Iterating global reduction 3 with 3 rules applied. Total rules applied 1206 place count 2456 transition count 2206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1206 place count 2456 transition count 2204
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1210 place count 2454 transition count 2204
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 6 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 3 with 1776 rules applied. Total rules applied 2986 place count 1566 transition count 1316
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 431 times.
Drop transitions removed 431 transitions
Iterating global reduction 3 with 431 rules applied. Total rules applied 3417 place count 1566 transition count 1316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3418 place count 1565 transition count 1315
Applied a total of 3418 rules in 940 ms. Remains 1565 /3059 variables (removed 1494) and now considering 1315/2809 (removed 1494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 1565/3059 places, 1315/2809 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1315 rows 1565 cols
[2024-05-29 10:40:46] [INFO ] Computed 551 invariants in 44 ms
[2024-05-29 10:40:47] [INFO ] [Real]Absence check using 518 positive place invariants in 92 ms returned sat
[2024-05-29 10:40:47] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 6 ms returned sat
[2024-05-29 10:40:47] [INFO ] After 1175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 10:40:48] [INFO ] [Nat]Absence check using 518 positive place invariants in 102 ms returned sat
[2024-05-29 10:40:48] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 6 ms returned sat
[2024-05-29 10:40:49] [INFO ] After 1027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 10:40:50] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 10:40:50] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2024-05-29 10:40:50] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-05-29 10:40:50] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 0 ms to minimize.
[2024-05-29 10:40:51] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2024-05-29 10:40:51] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-29 10:40:51] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2024-05-29 10:40:51] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 10:40:52] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2024-05-29 10:40:52] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2024-05-29 10:40:52] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2024-05-29 10:40:52] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 10:40:53] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 10:40:53] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 10:40:53] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2024-05-29 10:40:53] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2024-05-29 10:40:53] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-29 10:40:54] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2024-05-29 10:40:54] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-05-29 10:40:54] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 10:40:54] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2024-05-29 10:40:54] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2024-05-29 10:40:54] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 10:40:55] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 10:40:55] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-29 10:40:55] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 10:40:55] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5624 ms
[2024-05-29 10:40:55] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2024-05-29 10:40:55] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-29 10:40:55] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-29 10:40:56] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 10:40:56] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 10:40:56] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 10:40:56] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-29 10:40:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1118 ms
[2024-05-29 10:40:56] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-29 10:40:56] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 10:40:57] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-29 10:40:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 509 ms
[2024-05-29 10:40:57] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-29 10:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-29 10:40:57] [INFO ] After 9157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 458 ms.
[2024-05-29 10:40:58] [INFO ] After 10373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 362 ms.
Support contains 12 out of 1565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1565/1565 places, 1315/1315 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1565 transition count 1314
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1564 transition count 1314
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 1557 transition count 1307
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 1557 transition count 1307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1555 transition count 1305
Applied a total of 24 rules in 205 ms. Remains 1555 /1565 variables (removed 10) and now considering 1305/1315 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 1555/1565 places, 1305/1315 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1305 rows 1555 cols
[2024-05-29 10:40:59] [INFO ] Computed 551 invariants in 29 ms
[2024-05-29 10:40:59] [INFO ] [Real]Absence check using 521 positive place invariants in 97 ms returned sat
[2024-05-29 10:40:59] [INFO ] [Real]Absence check using 521 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-29 10:41:00] [INFO ] After 1339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:41:01] [INFO ] [Nat]Absence check using 521 positive place invariants in 96 ms returned sat
[2024-05-29 10:41:01] [INFO ] [Nat]Absence check using 521 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-29 10:41:02] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:41:02] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2024-05-29 10:41:02] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2024-05-29 10:41:03] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2024-05-29 10:41:03] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 10:41:03] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-29 10:41:03] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-29 10:41:03] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-29 10:41:04] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2024-05-29 10:41:04] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-29 10:41:04] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 10:41:04] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2024-05-29 10:41:04] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:41:04] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2024-05-29 10:41:05] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2024-05-29 10:41:05] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2024-05-29 10:41:05] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2024-05-29 10:41:05] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2024-05-29 10:41:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 10:41:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3488 ms
[2024-05-29 10:41:06] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-05-29 10:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2024-05-29 10:41:06] [INFO ] After 4873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 215 ms.
[2024-05-29 10:41:06] [INFO ] After 5578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 1555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1555/1555 places, 1305/1305 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 1555 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1554 transition count 1304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1552 transition count 1302
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1552 transition count 1302
Applied a total of 7 rules in 158 ms. Remains 1552 /1555 variables (removed 3) and now considering 1302/1305 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 1552/1555 places, 1302/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 95106 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95106 steps, saw 87923 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1302 rows 1552 cols
[2024-05-29 10:41:10] [INFO ] Computed 551 invariants in 17 ms
[2024-05-29 10:41:10] [INFO ] [Real]Absence check using 520 positive place invariants in 91 ms returned sat
[2024-05-29 10:41:10] [INFO ] [Real]Absence check using 520 positive and 31 generalized place invariants in 6 ms returned sat
[2024-05-29 10:41:11] [INFO ] After 1298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:41:11] [INFO ] [Nat]Absence check using 520 positive place invariants in 103 ms returned sat
[2024-05-29 10:41:11] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 9 ms returned sat
[2024-05-29 10:41:12] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:41:13] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 10:41:13] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 4 ms to minimize.
[2024-05-29 10:41:13] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2024-05-29 10:41:13] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-29 10:41:14] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2024-05-29 10:41:14] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 10:41:14] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 10:41:14] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 10:41:14] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:41:14] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 10:41:15] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 10:41:16] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4234 ms
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-29 10:41:17] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 10:41:18] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2024-05-29 10:41:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 901 ms
[2024-05-29 10:41:18] [INFO ] After 6329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 249 ms.
[2024-05-29 10:41:18] [INFO ] After 7085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 299 ms.
Support contains 6 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 73 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 59 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2024-05-29 10:41:19] [INFO ] Invariant cache hit.
[2024-05-29 10:41:20] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-29 10:41:20] [INFO ] Invariant cache hit.
[2024-05-29 10:41:22] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 3335 ms to find 0 implicit places.
[2024-05-29 10:41:22] [INFO ] Redundant transitions in 85 ms returned []
[2024-05-29 10:41:22] [INFO ] Invariant cache hit.
[2024-05-29 10:41:23] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4269 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 60 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 10:41:23] [INFO ] Invariant cache hit.
[2024-05-29 10:41:23] [INFO ] [Real]Absence check using 520 positive place invariants in 95 ms returned sat
[2024-05-29 10:41:23] [INFO ] [Real]Absence check using 520 positive and 31 generalized place invariants in 6 ms returned sat
[2024-05-29 10:41:24] [INFO ] After 1377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:41:25] [INFO ] [Nat]Absence check using 520 positive place invariants in 90 ms returned sat
[2024-05-29 10:41:25] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 6 ms returned sat
[2024-05-29 10:41:26] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:41:26] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 10:41:26] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-29 10:41:26] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-29 10:41:26] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2024-05-29 10:41:27] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2024-05-29 10:41:27] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 10:41:27] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 10:41:27] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 10:41:27] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 10:41:28] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 10:41:28] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2024-05-29 10:41:28] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2024-05-29 10:41:28] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 10:41:28] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2024-05-29 10:41:29] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2024-05-29 10:41:29] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2024-05-29 10:41:29] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2024-05-29 10:41:29] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2024-05-29 10:41:29] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 10:41:30] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2024-05-29 10:41:30] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2024-05-29 10:41:30] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 10:41:30] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4402 ms
[2024-05-29 10:41:30] [INFO ] After 5564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 250 ms.
[2024-05-29 10:41:30] [INFO ] After 6270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 602 stabilizing places and 602 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3058 transition count 2457
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2707 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1211 place count 2449 transition count 2199
Iterating global reduction 3 with 7 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1218 place count 2449 transition count 2196
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1224 place count 2446 transition count 2196
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 2 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 3 with 1786 rules applied. Total rules applied 3010 place count 1553 transition count 1303
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 3012 place count 1551 transition count 1301
Applied a total of 3012 rules in 666 ms. Remains 1551 /3059 variables (removed 1508) and now considering 1301/2809 (removed 1508) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2024-05-29 10:41:32] [INFO ] Computed 551 invariants in 7 ms
[2024-05-29 10:41:32] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-29 10:41:32] [INFO ] Invariant cache hit.
[2024-05-29 10:41:34] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2024-05-29 10:41:34] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-29 10:41:34] [INFO ] Invariant cache hit.
[2024-05-29 10:41:35] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3059 places, 1301/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4229 ms. Remains : 1551/3059 places, 1301/2809 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 257 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s880 1) (EQ s882 1)), p0:(NEQ s816 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 65 reset in 1100 ms.
Product exploration explored 100000 steps with 65 reset in 1257 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 1450 steps, including 0 resets, run visited all 3 properties in 46 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-05-29 10:41:39] [INFO ] Invariant cache hit.
[2024-05-29 10:41:40] [INFO ] [Real]Absence check using 551 positive place invariants in 387 ms returned sat
[2024-05-29 10:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:41:46] [INFO ] [Real]Absence check using state equation in 5854 ms returned sat
[2024-05-29 10:41:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:41:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 440 ms returned sat
[2024-05-29 10:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:41:53] [INFO ] [Nat]Absence check using state equation in 5061 ms returned sat
[2024-05-29 10:41:53] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 91 ms.
[2024-05-29 10:42:01] [INFO ] Added : 355 causal constraints over 71 iterations in 8309 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 70 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-05-29 10:42:01] [INFO ] Invariant cache hit.
[2024-05-29 10:42:02] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-29 10:42:02] [INFO ] Invariant cache hit.
[2024-05-29 10:42:04] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2024-05-29 10:42:04] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-29 10:42:04] [INFO ] Invariant cache hit.
[2024-05-29 10:42:04] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3449 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 1652 steps, including 0 resets, run visited all 3 properties in 48 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2024-05-29 10:42:05] [INFO ] Invariant cache hit.
[2024-05-29 10:42:07] [INFO ] [Real]Absence check using 551 positive place invariants in 426 ms returned sat
[2024-05-29 10:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:42:13] [INFO ] [Real]Absence check using state equation in 5715 ms returned sat
[2024-05-29 10:42:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:42:14] [INFO ] [Nat]Absence check using 551 positive place invariants in 377 ms returned sat
[2024-05-29 10:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:42:19] [INFO ] [Nat]Absence check using state equation in 5140 ms returned sat
[2024-05-29 10:42:19] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 61 ms.
[2024-05-29 10:42:28] [INFO ] Added : 350 causal constraints over 70 iterations in 8213 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 64 reset in 1020 ms.
Product exploration explored 100000 steps with 64 reset in 1218 ms.
Built C files in :
/tmp/ltsmin14543149486903698904
[2024-05-29 10:42:30] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2024-05-29 10:42:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:42:30] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2024-05-29 10:42:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:42:30] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2024-05-29 10:42:30] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:42:30] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14543149486903698904
Running compilation step : cd /tmp/ltsmin14543149486903698904;'/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/ltsmin14543149486903698904;'/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/ltsmin14543149486903698904;'/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 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 66 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-05-29 10:42:33] [INFO ] Invariant cache hit.
[2024-05-29 10:42:34] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-29 10:42:34] [INFO ] Invariant cache hit.
[2024-05-29 10:42:36] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2799 ms to find 0 implicit places.
[2024-05-29 10:42:36] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-29 10:42:36] [INFO ] Invariant cache hit.
[2024-05-29 10:42:37] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3724 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin13125020183546323153
[2024-05-29 10:42:37] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2024-05-29 10:42:37] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:42:37] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2024-05-29 10:42:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:42:37] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2024-05-29 10:42:37] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:42:37] [INFO ] Built C files in 314ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13125020183546323153
Running compilation step : cd /tmp/ltsmin13125020183546323153;'/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/ltsmin13125020183546323153;'/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/ltsmin13125020183546323153;'/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 10:42:41] [INFO ] Flatten gal took : 55 ms
[2024-05-29 10:42:41] [INFO ] Flatten gal took : 50 ms
[2024-05-29 10:42:41] [INFO ] Time to serialize gal into /tmp/LTL10922136795859643114.gal : 14 ms
[2024-05-29 10:42:41] [INFO ] Time to serialize properties into /tmp/LTL17625926446284197641.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/LTL10922136795859643114.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13199205269644525379.hoa' '-atoms' '/tmp/LTL17625926446284197641.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17625926446284197641.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13199205269644525379.hoa
Detected timeout of ITS tools.
[2024-05-29 10:42:56] [INFO ] Flatten gal took : 46 ms
[2024-05-29 10:42:56] [INFO ] Flatten gal took : 45 ms
[2024-05-29 10:42:56] [INFO ] Time to serialize gal into /tmp/LTL5103619120108792226.gal : 7 ms
[2024-05-29 10:42:56] [INFO ] Time to serialize properties into /tmp/LTL233900536524409297.ltl : 11 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/LTL5103619120108792226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL233900536524409297.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 : !(((G(F("(p1815!=1)")))U("((p1951==1)&&(p1953==1))")))
Formula 0 simplified : FG!"(p1815!=1)" R !"((p1951==1)&&(p1953==1))"
Detected timeout of ITS tools.
[2024-05-29 10:43:11] [INFO ] Flatten gal took : 48 ms
[2024-05-29 10:43:11] [INFO ] Applying decomposition
[2024-05-29 10:43:11] [INFO ] Flatten gal took : 58 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/graph6004861773796785670.txt' '-o' '/tmp/graph6004861773796785670.bin' '-w' '/tmp/graph6004861773796785670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6004861773796785670.bin' '-l' '-1' '-v' '-w' '/tmp/graph6004861773796785670.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:43:11] [INFO ] Decomposing Gal with order
[2024-05-29 10:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:43:12] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-29 10:43:12] [INFO ] Flatten gal took : 223 ms
[2024-05-29 10:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 61 ms.
[2024-05-29 10:43:12] [INFO ] Time to serialize gal into /tmp/LTL12951414703201731126.gal : 30 ms
[2024-05-29 10:43:12] [INFO ] Time to serialize properties into /tmp/LTL11152295839080615465.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/LTL12951414703201731126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11152295839080615465.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 : !(((G(F("(i26.i0.i1.u291.p1815!=1)")))U("((i28.u312.p1951==1)&&(i28.u313.p1953==1))")))
Formula 0 simplified : FG!"(i26.i0.i1.u291.p1815!=1)" R !"((i28.u312.p1951==1)&&(i28.u313.p1953==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11433227491646971966
[2024-05-29 10:43:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11433227491646971966
Running compilation step : cd /tmp/ltsmin11433227491646971966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2510 ms.
Running link step : cd /tmp/ltsmin11433227491646971966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin11433227491646971966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-00 finished in 131294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 444 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2024-05-29 10:43:43] [INFO ] Computed 551 invariants in 27 ms
[2024-05-29 10:43:44] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2024-05-29 10:43:44] [INFO ] Invariant cache hit.
[2024-05-29 10:43:48] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 5048 ms to find 0 implicit places.
[2024-05-29 10:43:48] [INFO ] Invariant cache hit.
[2024-05-29 10:43:50] [INFO ] Dead Transitions using invariants and state equation in 2262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7757 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s255 1) (EQ s257 1)), p0:(EQ s2205 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 43 reset in 947 ms.
Product exploration explored 100000 steps with 43 reset in 1104 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 10:43:53] [INFO ] Invariant cache hit.
[2024-05-29 10:43:54] [INFO ] [Real]Absence check using 551 positive place invariants in 226 ms returned sat
[2024-05-29 10:43:56] [INFO ] After 2668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 10:43:56] [INFO ] [Nat]Absence check using 551 positive place invariants in 232 ms returned sat
[2024-05-29 10:43:58] [INFO ] After 1870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 10:43:59] [INFO ] Deduced a trap composed of 16 places in 855 ms of which 2 ms to minimize.
[2024-05-29 10:44:00] [INFO ] Deduced a trap composed of 34 places in 962 ms of which 2 ms to minimize.
[2024-05-29 10:44:01] [INFO ] Deduced a trap composed of 35 places in 931 ms of which 2 ms to minimize.
[2024-05-29 10:44:02] [INFO ] Deduced a trap composed of 16 places in 949 ms of which 2 ms to minimize.
[2024-05-29 10:44:03] [INFO ] Deduced a trap composed of 24 places in 944 ms of which 2 ms to minimize.
[2024-05-29 10:44:05] [INFO ] Deduced a trap composed of 32 places in 945 ms of which 4 ms to minimize.
[2024-05-29 10:44:06] [INFO ] Deduced a trap composed of 30 places in 920 ms of which 2 ms to minimize.
[2024-05-29 10:44:07] [INFO ] Deduced a trap composed of 22 places in 965 ms of which 2 ms to minimize.
[2024-05-29 10:44:08] [INFO ] Deduced a trap composed of 21 places in 903 ms of which 2 ms to minimize.
[2024-05-29 10:44:09] [INFO ] Deduced a trap composed of 33 places in 898 ms of which 2 ms to minimize.
[2024-05-29 10:44:10] [INFO ] Deduced a trap composed of 27 places in 860 ms of which 2 ms to minimize.
[2024-05-29 10:44:11] [INFO ] Deduced a trap composed of 24 places in 839 ms of which 2 ms to minimize.
[2024-05-29 10:44:11] [INFO ] Deduced a trap composed of 37 places in 839 ms of which 1 ms to minimize.
[2024-05-29 10:44:12] [INFO ] Deduced a trap composed of 27 places in 827 ms of which 1 ms to minimize.
[2024-05-29 10:44:13] [INFO ] Deduced a trap composed of 21 places in 829 ms of which 1 ms to minimize.
[2024-05-29 10:44:14] [INFO ] Deduced a trap composed of 33 places in 836 ms of which 2 ms to minimize.
[2024-05-29 10:44:15] [INFO ] Deduced a trap composed of 35 places in 819 ms of which 2 ms to minimize.
[2024-05-29 10:44:16] [INFO ] Deduced a trap composed of 35 places in 839 ms of which 2 ms to minimize.
[2024-05-29 10:44:17] [INFO ] Deduced a trap composed of 39 places in 871 ms of which 1 ms to minimize.
[2024-05-29 10:44:18] [INFO ] Deduced a trap composed of 43 places in 871 ms of which 1 ms to minimize.
[2024-05-29 10:44:19] [INFO ] Deduced a trap composed of 33 places in 823 ms of which 2 ms to minimize.
[2024-05-29 10:44:20] [INFO ] Deduced a trap composed of 43 places in 797 ms of which 2 ms to minimize.
[2024-05-29 10:44:21] [INFO ] Deduced a trap composed of 34 places in 811 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 10:44:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:44:21] [INFO ] After 25167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 3 out of 3053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2452
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2702 transition count 2451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 2 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 3002 place count 1552 transition count 1302
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 3 with 446 rules applied. Total rules applied 3448 place count 1552 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3449 place count 1551 transition count 1301
Applied a total of 3449 rules in 528 ms. Remains 1551 /3053 variables (removed 1502) and now considering 1301/2803 (removed 1502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 1551/3053 places, 1301/2803 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2024-05-29 10:44:22] [INFO ] Computed 551 invariants in 13 ms
[2024-05-29 10:44:22] [INFO ] [Real]Absence check using 529 positive place invariants in 102 ms returned sat
[2024-05-29 10:44:22] [INFO ] [Real]Absence check using 529 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-29 10:44:22] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:44:22] [INFO ] [Nat]Absence check using 529 positive place invariants in 97 ms returned sat
[2024-05-29 10:44:22] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-29 10:44:23] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:44:23] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2024-05-29 10:44:24] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2024-05-29 10:44:24] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 10:44:24] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2024-05-29 10:44:24] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2024-05-29 10:44:24] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 10:44:26] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2024-05-29 10:44:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2380 ms
[2024-05-29 10:44:26] [INFO ] After 3159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 10:44:26] [INFO ] After 3559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 59 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71842 steps, run visited all 1 properties in 1416 ms. (steps per millisecond=50 )
Probabilistic random walk after 71842 steps, saw 65855 distinct states, run finished after 1418 ms. (steps per millisecond=50 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
// Phase 1: matrix 2803 rows 3053 cols
[2024-05-29 10:44:28] [INFO ] Computed 551 invariants in 19 ms
[2024-05-29 10:44:32] [INFO ] [Real]Absence check using 551 positive place invariants in 1367 ms returned sat
[2024-05-29 10:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:44:43] [INFO ] [Real]Absence check using state equation in 11292 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-29 10:44:43] [INFO ] Invariant cache hit.
[2024-05-29 10:44:47] [INFO ] [Real]Absence check using 551 positive place invariants in 1108 ms returned sat
[2024-05-29 10:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:44:58] [INFO ] [Real]Absence check using state equation in 11625 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3052 transition count 2451
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2701 transition count 2450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2700 transition count 2450
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2700 transition count 2200
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2450 transition count 2200
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 2998 place count 1553 transition count 1303
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 3000 place count 1551 transition count 1301
Applied a total of 3000 rules in 442 ms. Remains 1551 /3053 variables (removed 1502) and now considering 1301/2803 (removed 1502) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2024-05-29 10:44:59] [INFO ] Computed 551 invariants in 8 ms
[2024-05-29 10:45:00] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-29 10:45:00] [INFO ] Invariant cache hit.
[2024-05-29 10:45:01] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
[2024-05-29 10:45:02] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-29 10:45:02] [INFO ] Invariant cache hit.
[2024-05-29 10:45:02] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3053 places, 1301/2803 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4030 ms. Remains : 1551/3053 places, 1301/2803 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:45:03] [INFO ] Invariant cache hit.
[2024-05-29 10:45:03] [INFO ] [Real]Absence check using 551 positive place invariants in 105 ms returned sat
[2024-05-29 10:45:04] [INFO ] After 602ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 473 ms
[2024-05-29 10:45:04] [INFO ] After 1123ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:45:04] [INFO ] After 1463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:45:05] [INFO ] [Nat]Absence check using 551 positive place invariants in 97 ms returned sat
[2024-05-29 10:45:05] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:45:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 10:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-05-29 10:45:06] [INFO ] After 827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-29 10:45:06] [INFO ] After 1199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1551 transition count 1301
Applied a total of 298 rules in 109 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55426 steps, run visited all 1 properties in 685 ms. (steps per millisecond=80 )
Probabilistic random walk after 55426 steps, saw 54523 distinct states, run finished after 689 ms. (steps per millisecond=80 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 13 factoid took 353 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
[2024-05-29 10:45:08] [INFO ] Invariant cache hit.
[2024-05-29 10:45:09] [INFO ] [Real]Absence check using 551 positive place invariants in 469 ms returned sat
[2024-05-29 10:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:45:15] [INFO ] [Real]Absence check using state equation in 5477 ms returned sat
[2024-05-29 10:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:45:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 445 ms returned sat
[2024-05-29 10:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:45:21] [INFO ] [Nat]Absence check using state equation in 4970 ms returned sat
[2024-05-29 10:45:21] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 86 ms.
[2024-05-29 10:45:30] [INFO ] Added : 335 causal constraints over 67 iterations in 8364 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-29 10:45:30] [INFO ] Invariant cache hit.
[2024-05-29 10:45:31] [INFO ] [Real]Absence check using 551 positive place invariants in 479 ms returned sat
[2024-05-29 10:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:45:37] [INFO ] [Real]Absence check using state equation in 5853 ms returned sat
[2024-05-29 10:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:45:39] [INFO ] [Nat]Absence check using 551 positive place invariants in 446 ms returned sat
[2024-05-29 10:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:45:44] [INFO ] [Nat]Absence check using state equation in 4902 ms returned sat
[2024-05-29 10:45:44] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-29 10:45:52] [INFO ] Added : 345 causal constraints over 69 iterations in 8375 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false, false]
Product exploration explored 100000 steps with 137 reset in 963 ms.
Product exploration explored 100000 steps with 138 reset in 1180 ms.
Built C files in :
/tmp/ltsmin4918552679291441031
[2024-05-29 10:45:55] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2024-05-29 10:45:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:45:55] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2024-05-29 10:45:55] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:45:55] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2024-05-29 10:45:55] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:45:55] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4918552679291441031
Running compilation step : cd /tmp/ltsmin4918552679291441031;'/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/ltsmin4918552679291441031;'/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/ltsmin4918552679291441031;'/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 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 63 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-05-29 10:45:58] [INFO ] Invariant cache hit.
[2024-05-29 10:45:59] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-29 10:45:59] [INFO ] Invariant cache hit.
[2024-05-29 10:46:01] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
[2024-05-29 10:46:01] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-29 10:46:01] [INFO ] Invariant cache hit.
[2024-05-29 10:46:02] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3636 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin11347506883386118454
[2024-05-29 10:46:02] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2024-05-29 10:46:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:46:02] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2024-05-29 10:46:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:46:02] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2024-05-29 10:46:02] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:46:02] [INFO ] Built C files in 278ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11347506883386118454
Running compilation step : cd /tmp/ltsmin11347506883386118454;'/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/ltsmin11347506883386118454;'/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/ltsmin11347506883386118454;'/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 10:46:05] [INFO ] Flatten gal took : 40 ms
[2024-05-29 10:46:05] [INFO ] Flatten gal took : 37 ms
[2024-05-29 10:46:05] [INFO ] Time to serialize gal into /tmp/LTL149270550603205985.gal : 9 ms
[2024-05-29 10:46:05] [INFO ] Time to serialize properties into /tmp/LTL8284127717375351523.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/LTL149270550603205985.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8781758878440020640.hoa' '-atoms' '/tmp/LTL8284127717375351523.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...316
Loading property file /tmp/LTL8284127717375351523.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8781758878440020640.hoa
Detected timeout of ITS tools.
[2024-05-29 10:46:20] [INFO ] Flatten gal took : 37 ms
[2024-05-29 10:46:20] [INFO ] Flatten gal took : 38 ms
[2024-05-29 10:46:20] [INFO ] Time to serialize gal into /tmp/LTL14549037782286148409.gal : 6 ms
[2024-05-29 10:46:20] [INFO ] Time to serialize properties into /tmp/LTL885906151369340963.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/LTL14549037782286148409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL885906151369340963.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("(p2455==1)"))U("((p276==1)&&(p278==1))"))))
Formula 0 simplified : X(G!"(p2455==1)" R !"((p276==1)&&(p278==1))")
Detected timeout of ITS tools.
[2024-05-29 10:46:35] [INFO ] Flatten gal took : 65 ms
[2024-05-29 10:46:35] [INFO ] Applying decomposition
[2024-05-29 10:46:36] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14947339642288008997.txt' '-o' '/tmp/graph14947339642288008997.bin' '-w' '/tmp/graph14947339642288008997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14947339642288008997.bin' '-l' '-1' '-v' '-w' '/tmp/graph14947339642288008997.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:46:36] [INFO ] Decomposing Gal with order
[2024-05-29 10:46:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:46:36] [INFO ] Removed a total of 301 redundant transitions.
[2024-05-29 10:46:36] [INFO ] Flatten gal took : 104 ms
[2024-05-29 10:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 10 ms.
[2024-05-29 10:46:36] [INFO ] Time to serialize gal into /tmp/LTL15214355138510971754.gal : 12 ms
[2024-05-29 10:46:36] [INFO ] Time to serialize properties into /tmp/LTL11834834346867768917.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/LTL15214355138510971754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11834834346867768917.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("(i35.u397.p2455==1)"))U("((i3.u37.p276==1)&&(i3.u38.p278==1))"))))
Formula 0 simplified : X(G!"(i35.u397.p2455==1)" R !"((i3.u37.p276==1)&&(i3.u38.p278==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3357693171889341685
[2024-05-29 10:46:51] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3357693171889341685
Running compilation step : cd /tmp/ltsmin3357693171889341685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2460 ms.
Running link step : cd /tmp/ltsmin3357693171889341685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3357693171889341685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true)) U (LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 9578 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050B-LTLFireability-01 finished in 200964 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 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3058 transition count 2457
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2707 transition count 2457
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2707 transition count 2207
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2457 transition count 2207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1209 place count 2450 transition count 2200
Iterating global reduction 2 with 7 rules applied. Total rules applied 1216 place count 2450 transition count 2200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1216 place count 2450 transition count 2197
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1222 place count 2447 transition count 2197
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 2 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 3008 place count 1554 transition count 1304
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 3010 place count 1552 transition count 1302
Applied a total of 3010 rules in 662 ms. Remains 1552 /3059 variables (removed 1507) and now considering 1302/2809 (removed 1507) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2024-05-29 10:47:04] [INFO ] Computed 551 invariants in 4 ms
[2024-05-29 10:47:05] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-05-29 10:47:05] [INFO ] Invariant cache hit.
[2024-05-29 10:47:06] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
[2024-05-29 10:47:06] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 10:47:06] [INFO ] Invariant cache hit.
[2024-05-29 10:47:07] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3059 places, 1302/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4096 ms. Remains : 1552/3059 places, 1302/2809 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-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:(OR (EQ s1344 0) (EQ s1357 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 194 reset in 971 ms.
Product exploration explored 100000 steps with 188 reset in 1167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 311 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 65 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2024-05-29 10:47:10] [INFO ] Invariant cache hit.
[2024-05-29 10:47:11] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-29 10:47:11] [INFO ] Invariant cache hit.
[2024-05-29 10:47:13] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2732 ms to find 0 implicit places.
[2024-05-29 10:47:13] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-29 10:47:13] [INFO ] Invariant cache hit.
[2024-05-29 10:47:14] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3666 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 408 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 197 reset in 925 ms.
Product exploration explored 100000 steps with 173 reset in 1145 ms.
Built C files in :
/tmp/ltsmin16790229982823570168
[2024-05-29 10:47:16] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2024-05-29 10:47:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:47:16] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2024-05-29 10:47:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:47:17] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2024-05-29 10:47:17] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:47:17] [INFO ] Built C files in 284ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16790229982823570168
Running compilation step : cd /tmp/ltsmin16790229982823570168;'/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/ltsmin16790229982823570168;'/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/ltsmin16790229982823570168;'/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 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 60 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2024-05-29 10:47:20] [INFO ] Invariant cache hit.
[2024-05-29 10:47:20] [INFO ] Implicit Places using invariants in 822 ms returned []
[2024-05-29 10:47:20] [INFO ] Invariant cache hit.
[2024-05-29 10:47:22] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
[2024-05-29 10:47:22] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-29 10:47:22] [INFO ] Invariant cache hit.
[2024-05-29 10:47:23] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3660 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Built C files in :
/tmp/ltsmin794499434266036478
[2024-05-29 10:47:23] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2024-05-29 10:47:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:47:23] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2024-05-29 10:47:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:47:23] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2024-05-29 10:47:23] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:47:23] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin794499434266036478
Running compilation step : cd /tmp/ltsmin794499434266036478;'/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/ltsmin794499434266036478;'/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/ltsmin794499434266036478;'/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 10:47:27] [INFO ] Flatten gal took : 37 ms
[2024-05-29 10:47:27] [INFO ] Flatten gal took : 76 ms
[2024-05-29 10:47:27] [INFO ] Time to serialize gal into /tmp/LTL15860143213669387143.gal : 17 ms
[2024-05-29 10:47:27] [INFO ] Time to serialize properties into /tmp/LTL13389388756199311901.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/LTL15860143213669387143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13983681653725307141.hoa' '-atoms' '/tmp/LTL13389388756199311901.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2955==0)||(p2973==0))"))))
Formula 0 simplified : FG!"((p2955==0)||(p2973==0))"
Detected timeout of ITS tools.
[2024-05-29 10:47:57] [INFO ] Flatten gal took : 33 ms
[2024-05-29 10:47:57] [INFO ] Applying decomposition
[2024-05-29 10:47:57] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2796735220325779682.txt' '-o' '/tmp/graph2796735220325779682.bin' '-w' '/tmp/graph2796735220325779682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2796735220325779682.bin' '-l' '-1' '-v' '-w' '/tmp/graph2796735220325779682.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:47:57] [INFO ] Decomposing Gal with order
[2024-05-29 10:47:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:47:57] [INFO ] Removed a total of 303 redundant transitions.
[2024-05-29 10:47:57] [INFO ] Flatten gal took : 59 ms
[2024-05-29 10:47:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 10 ms.
[2024-05-29 10:47:57] [INFO ] Time to serialize gal into /tmp/LTL16472092634904951462.gal : 11 ms
[2024-05-29 10:47:57] [INFO ] Time to serialize properties into /tmp/LTL16383394976804274323.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/LTL16472092634904951462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16383394976804274323.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 : !((G(F("((i43.u478.p2955==0)||(i43.u481.p2973==0))"))))
Formula 0 simplified : FG!"((i43.u478.p2955==0)||(i43.u481.p2973==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9533944070818422430
[2024-05-29 10:48:12] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9533944070818422430
Running compilation step : cd /tmp/ltsmin9533944070818422430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2458 ms.
Running link step : cd /tmp/ltsmin9533944070818422430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9533944070818422430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-02 finished in 84274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1||(p1 U G(p2)))))))'
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3054 transition count 2804
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3054 transition count 2804
Applied a total of 10 rules in 430 ms. Remains 3054 /3059 variables (removed 5) and now considering 2804/2809 (removed 5) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2024-05-29 10:48:28] [INFO ] Computed 551 invariants in 22 ms
[2024-05-29 10:48:29] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2024-05-29 10:48:29] [INFO ] Invariant cache hit.
[2024-05-29 10:48:33] [INFO ] Implicit Places using invariants and state equation in 3912 ms returned []
Implicit Place search using SMT with State Equation took 5364 ms to find 0 implicit places.
[2024-05-29 10:48:33] [INFO ] Invariant cache hit.
[2024-05-29 10:48:36] [INFO ] Dead Transitions using invariants and state equation in 2467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3059 places, 2804/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8266 ms. Remains : 3054/3059 places, 2804/2809 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2067 0), p1:(EQ s42 1), p2:(EQ s637 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 81 reset in 700 ms.
Product exploration explored 100000 steps with 85 reset in 795 ms.
Computed a total of 601 stabilizing places and 601 stable transitions
Computed a total of 601 stabilizing places and 601 stable transitions
Detected a total of 601/3054 stabilizing places and 601/2804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 240 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 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
Running SMT prover for 4 properties.
[2024-05-29 10:48:38] [INFO ] Invariant cache hit.
[2024-05-29 10:48:39] [INFO ] [Real]Absence check using 551 positive place invariants in 242 ms returned sat
[2024-05-29 10:48:41] [INFO ] After 2734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:48:42] [INFO ] [Nat]Absence check using 551 positive place invariants in 217 ms returned sat
[2024-05-29 10:48:44] [INFO ] After 2162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:48:45] [INFO ] Deduced a trap composed of 37 places in 1005 ms of which 2 ms to minimize.
[2024-05-29 10:48:46] [INFO ] Deduced a trap composed of 21 places in 1039 ms of which 2 ms to minimize.
[2024-05-29 10:48:47] [INFO ] Deduced a trap composed of 12 places in 1053 ms of which 2 ms to minimize.
[2024-05-29 10:48:48] [INFO ] Deduced a trap composed of 32 places in 1002 ms of which 2 ms to minimize.
[2024-05-29 10:48:50] [INFO ] Deduced a trap composed of 17 places in 1004 ms of which 2 ms to minimize.
[2024-05-29 10:48:51] [INFO ] Deduced a trap composed of 42 places in 938 ms of which 2 ms to minimize.
[2024-05-29 10:48:52] [INFO ] Deduced a trap composed of 28 places in 981 ms of which 1 ms to minimize.
[2024-05-29 10:48:53] [INFO ] Deduced a trap composed of 36 places in 937 ms of which 1 ms to minimize.
[2024-05-29 10:48:54] [INFO ] Deduced a trap composed of 35 places in 916 ms of which 2 ms to minimize.
[2024-05-29 10:48:55] [INFO ] Deduced a trap composed of 41 places in 906 ms of which 2 ms to minimize.
[2024-05-29 10:48:56] [INFO ] Deduced a trap composed of 35 places in 945 ms of which 2 ms to minimize.
[2024-05-29 10:48:57] [INFO ] Deduced a trap composed of 40 places in 876 ms of which 4 ms to minimize.
[2024-05-29 10:48:58] [INFO ] Deduced a trap composed of 44 places in 884 ms of which 2 ms to minimize.
[2024-05-29 10:48:59] [INFO ] Deduced a trap composed of 34 places in 851 ms of which 2 ms to minimize.
[2024-05-29 10:49:00] [INFO ] Deduced a trap composed of 41 places in 847 ms of which 2 ms to minimize.
[2024-05-29 10:49:01] [INFO ] Deduced a trap composed of 42 places in 858 ms of which 2 ms to minimize.
[2024-05-29 10:49:02] [INFO ] Deduced a trap composed of 53 places in 862 ms of which 1 ms to minimize.
[2024-05-29 10:49:03] [INFO ] Deduced a trap composed of 43 places in 855 ms of which 2 ms to minimize.
[2024-05-29 10:49:04] [INFO ] Deduced a trap composed of 42 places in 863 ms of which 2 ms to minimize.
[2024-05-29 10:49:05] [INFO ] Deduced a trap composed of 52 places in 864 ms of which 2 ms to minimize.
[2024-05-29 10:49:05] [INFO ] Deduced a trap composed of 45 places in 865 ms of which 2 ms to minimize.
[2024-05-29 10:49:06] [INFO ] Deduced a trap composed of 60 places in 845 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 10:49:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:49:06] [INFO ] After 25514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 488 ms.
Support contains 3 out of 3054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3054 transition count 2452
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2702 transition count 2452
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2702 transition count 2202
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2452 transition count 2202
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 2998 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 2 with 447 rules applied. Total rules applied 3445 place count 1555 transition count 1305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3446 place count 1554 transition count 1304
Applied a total of 3446 rules in 472 ms. Remains 1554 /3054 variables (removed 1500) and now considering 1304/2804 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 1554/3054 places, 1304/2804 transitions.
Finished random walk after 3256 steps, including 0 resets, run visited all 4 properties in 79 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 16 factoid took 1239 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2024-05-29 10:49:09] [INFO ] Invariant cache hit.
[2024-05-29 10:49:12] [INFO ] [Real]Absence check using 551 positive place invariants in 1064 ms returned sat
[2024-05-29 10:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:49:24] [INFO ] [Real]Absence check using state equation in 11733 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 3054 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Applied a total of 0 rules in 209 ms. Remains 3054 /3054 variables (removed 0) and now considering 2804/2804 (removed 0) transitions.
[2024-05-29 10:49:24] [INFO ] Invariant cache hit.
[2024-05-29 10:49:25] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-29 10:49:26] [INFO ] Invariant cache hit.
[2024-05-29 10:49:29] [INFO ] Implicit Places using invariants and state equation in 3960 ms returned []
Implicit Place search using SMT with State Equation took 5286 ms to find 0 implicit places.
[2024-05-29 10:49:29] [INFO ] Invariant cache hit.
[2024-05-29 10:49:32] [INFO ] Dead Transitions using invariants and state equation in 2282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7799 ms. Remains : 3054/3054 places, 2804/2804 transitions.
Computed a total of 601 stabilizing places and 601 stable transitions
Computed a total of 601 stabilizing places and 601 stable transitions
Detected a total of 601/3054 stabilizing places and 601/2804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 270 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 10:49:33] [INFO ] Invariant cache hit.
[2024-05-29 10:49:33] [INFO ] [Real]Absence check using 551 positive place invariants in 237 ms returned sat
[2024-05-29 10:49:35] [INFO ] After 2861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 10:49:36] [INFO ] [Nat]Absence check using 551 positive place invariants in 227 ms returned sat
[2024-05-29 10:49:39] [INFO ] After 2273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 10:49:40] [INFO ] Deduced a trap composed of 37 places in 1015 ms of which 2 ms to minimize.
[2024-05-29 10:49:41] [INFO ] Deduced a trap composed of 21 places in 1054 ms of which 2 ms to minimize.
[2024-05-29 10:49:42] [INFO ] Deduced a trap composed of 12 places in 1018 ms of which 1 ms to minimize.
[2024-05-29 10:49:43] [INFO ] Deduced a trap composed of 32 places in 962 ms of which 2 ms to minimize.
[2024-05-29 10:49:44] [INFO ] Deduced a trap composed of 17 places in 1006 ms of which 2 ms to minimize.
[2024-05-29 10:49:45] [INFO ] Deduced a trap composed of 42 places in 962 ms of which 2 ms to minimize.
[2024-05-29 10:49:46] [INFO ] Deduced a trap composed of 28 places in 860 ms of which 2 ms to minimize.
[2024-05-29 10:49:47] [INFO ] Deduced a trap composed of 36 places in 913 ms of which 2 ms to minimize.
[2024-05-29 10:49:48] [INFO ] Deduced a trap composed of 35 places in 985 ms of which 2 ms to minimize.
[2024-05-29 10:49:49] [INFO ] Deduced a trap composed of 41 places in 933 ms of which 1 ms to minimize.
[2024-05-29 10:49:50] [INFO ] Deduced a trap composed of 35 places in 923 ms of which 2 ms to minimize.
[2024-05-29 10:49:51] [INFO ] Deduced a trap composed of 40 places in 930 ms of which 1 ms to minimize.
[2024-05-29 10:49:52] [INFO ] Deduced a trap composed of 44 places in 887 ms of which 3 ms to minimize.
[2024-05-29 10:49:53] [INFO ] Deduced a trap composed of 34 places in 881 ms of which 2 ms to minimize.
[2024-05-29 10:49:54] [INFO ] Deduced a trap composed of 41 places in 887 ms of which 2 ms to minimize.
[2024-05-29 10:49:55] [INFO ] Deduced a trap composed of 42 places in 881 ms of which 2 ms to minimize.
[2024-05-29 10:49:56] [INFO ] Deduced a trap composed of 53 places in 820 ms of which 2 ms to minimize.
[2024-05-29 10:49:57] [INFO ] Deduced a trap composed of 43 places in 860 ms of which 3 ms to minimize.
[2024-05-29 10:49:58] [INFO ] Deduced a trap composed of 42 places in 823 ms of which 1 ms to minimize.
[2024-05-29 10:49:59] [INFO ] Deduced a trap composed of 52 places in 812 ms of which 1 ms to minimize.
[2024-05-29 10:50:00] [INFO ] Deduced a trap composed of 45 places in 856 ms of which 2 ms to minimize.
[2024-05-29 10:50:01] [INFO ] Deduced a trap composed of 60 places in 794 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 10:50:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:50:01] [INFO ] After 25544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 499 ms.
Support contains 3 out of 3054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3054 transition count 2452
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2702 transition count 2452
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2702 transition count 2202
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2452 transition count 2202
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 2998 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 2 with 447 rules applied. Total rules applied 3445 place count 1555 transition count 1305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3446 place count 1554 transition count 1304
Applied a total of 3446 rules in 504 ms. Remains 1554 /3054 variables (removed 1500) and now considering 1304/2804 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 1554/3054 places, 1304/2804 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1304 rows 1554 cols
[2024-05-29 10:50:02] [INFO ] Computed 551 invariants in 17 ms
[2024-05-29 10:50:03] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 10:50:03] [INFO ] [Nat]Absence check using 526 positive place invariants in 99 ms returned sat
[2024-05-29 10:50:03] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-29 10:50:04] [INFO ] After 953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 10:50:05] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 10:50:05] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 10:50:05] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 10:50:05] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 10:50:05] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2024-05-29 10:50:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 865 ms
[2024-05-29 10:50:05] [INFO ] After 2379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 410 ms.
[2024-05-29 10:50:06] [INFO ] After 3184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 116 ms.
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1554/1554 places, 1304/1304 transitions.
Applied a total of 0 rules in 54 ms. Remains 1554 /1554 variables (removed 0) and now considering 1304/1304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1554/1554 places, 1304/1304 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Finished probabilistic random walk after 54980 steps, run visited all 2 properties in 1390 ms. (steps per millisecond=39 )
Probabilistic random walk after 54980 steps, saw 50127 distinct states, run finished after 1391 ms. (steps per millisecond=39 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 16 factoid took 935 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 2804 rows 3054 cols
[2024-05-29 10:50:09] [INFO ] Computed 551 invariants in 17 ms
[2024-05-29 10:50:12] [INFO ] [Real]Absence check using 551 positive place invariants in 991 ms returned sat
[2024-05-29 10:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:50:24] [INFO ] [Real]Absence check using state equation in 11749 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 84 reset in 769 ms.
Product exploration explored 100000 steps with 85 reset in 829 ms.
Built C files in :
/tmp/ltsmin5363832592625291692
[2024-05-29 10:50:26] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5363832592625291692
Running compilation step : cd /tmp/ltsmin5363832592625291692;'/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/ltsmin5363832592625291692;'/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/ltsmin5363832592625291692;'/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 3054 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3054/3054 places, 2804/2804 transitions.
Applied a total of 0 rules in 210 ms. Remains 3054 /3054 variables (removed 0) and now considering 2804/2804 (removed 0) transitions.
[2024-05-29 10:50:29] [INFO ] Invariant cache hit.
[2024-05-29 10:50:30] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2024-05-29 10:50:30] [INFO ] Invariant cache hit.
[2024-05-29 10:50:34] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 5333 ms to find 0 implicit places.
[2024-05-29 10:50:34] [INFO ] Invariant cache hit.
[2024-05-29 10:50:37] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7840 ms. Remains : 3054/3054 places, 2804/2804 transitions.
Built C files in :
/tmp/ltsmin16207204412533386669
[2024-05-29 10:50:37] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16207204412533386669
Running compilation step : cd /tmp/ltsmin16207204412533386669;'/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/ltsmin16207204412533386669;'/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/ltsmin16207204412533386669;'/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 10:50:40] [INFO ] Flatten gal took : 55 ms
[2024-05-29 10:50:40] [INFO ] Flatten gal took : 57 ms
[2024-05-29 10:50:40] [INFO ] Time to serialize gal into /tmp/LTL7263518204075038517.gal : 21 ms
[2024-05-29 10:50:40] [INFO ] Time to serialize properties into /tmp/LTL15804206939131005663.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/LTL7263518204075038517.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7755899378318748884.hoa' '-atoms' '/tmp/LTL15804206939131005663.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/LTL15804206939131005663.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7755899378318748884.hoa
Detected timeout of ITS tools.
[2024-05-29 10:50:55] [INFO ] Flatten gal took : 59 ms
[2024-05-29 10:50:55] [INFO ] Flatten gal took : 76 ms
[2024-05-29 10:50:55] [INFO ] Time to serialize gal into /tmp/LTL13415436365857738398.gal : 12 ms
[2024-05-29 10:50:55] [INFO ] Time to serialize properties into /tmp/LTL4301962481157029230.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/LTL13415436365857738398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4301962481157029230.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 : !((F(("(p2297==0)")&&(X(("(p42==1)")||(("(p42==1)")U(G("(p703==1)"))))))))
Formula 0 simplified : G(!"(p2297==0)" | X(!"(p42==1)" & (!"(p42==1)" R F!"(p703==1)")))
Detected timeout of ITS tools.
[2024-05-29 10:51:10] [INFO ] Flatten gal took : 67 ms
[2024-05-29 10:51:10] [INFO ] Applying decomposition
[2024-05-29 10:51:10] [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/graph12785504645543747028.txt' '-o' '/tmp/graph12785504645543747028.bin' '-w' '/tmp/graph12785504645543747028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12785504645543747028.bin' '-l' '-1' '-v' '-w' '/tmp/graph12785504645543747028.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:51:11] [INFO ] Decomposing Gal with order
[2024-05-29 10:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:51:11] [INFO ] Removed a total of 450 redundant transitions.
[2024-05-29 10:51:11] [INFO ] Flatten gal took : 126 ms
[2024-05-29 10:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-29 10:51:11] [INFO ] Time to serialize gal into /tmp/LTL5401603115006362507.gal : 33 ms
[2024-05-29 10:51:11] [INFO ] Time to serialize properties into /tmp/LTL4909028331657505233.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5401603115006362507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4909028331657505233.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(("(i33.i2.i1.u819.p2297==0)")&&(X(("(i3.i4.i2.u19.p42==1)")||(("(i3.i4.i2.u19.p42==1)")U(G("(i12.u257.p703==1)"))))))))
Formula 0 simplified : G(!"(i33.i2.i1.u819.p2297==0)" | X(!"(i3.i4.i2.u19.p42==1)" & (!"(i3.i4.i2.u19.p42==1)" R F!"(i12.u257.p703==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7194756299604397372
[2024-05-29 10:51:26] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7194756299604397372
Running compilation step : cd /tmp/ltsmin7194756299604397372;'/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/ltsmin7194756299604397372;'/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/ltsmin7194756299604397372;'/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-050B-LTLFireability-03 finished in 181891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3058 transition count 2456
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 2 with 6 rules applied. Total rules applied 1216 place count 2450 transition count 2200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1216 place count 2450 transition count 2197
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1222 place count 2447 transition count 2197
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 2 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 3008 place count 1554 transition count 1304
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 3010 place count 1552 transition count 1302
Applied a total of 3010 rules in 609 ms. Remains 1552 /3059 variables (removed 1507) and now considering 1302/2809 (removed 1507) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2024-05-29 10:51:30] [INFO ] Computed 551 invariants in 10 ms
[2024-05-29 10:51:31] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-29 10:51:31] [INFO ] Invariant cache hit.
[2024-05-29 10:51:33] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
[2024-05-29 10:51:33] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-29 10:51:33] [INFO ] Invariant cache hit.
[2024-05-29 10:51:34] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3059 places, 1302/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4246 ms. Remains : 1552/3059 places, 1302/2809 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1331 0), p0:(OR (EQ s1153 0) (EQ s1170 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 29 reset in 1122 ms.
Product exploration explored 100000 steps with 29 reset in 1326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 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 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:51:37] [INFO ] Invariant cache hit.
[2024-05-29 10:51:37] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:51:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 100 ms returned sat
[2024-05-29 10:51:38] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:51:38] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:51:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-29 10:51:38] [INFO ] After 784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-29 10:51:38] [INFO ] After 1164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1552 transition count 1302
Applied a total of 297 rules in 100 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224475 steps, run timeout after 3002 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224475 steps, saw 222205 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1302 rows 1552 cols
[2024-05-29 10:51:41] [INFO ] Computed 551 invariants in 17 ms
[2024-05-29 10:51:42] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:51:42] [INFO ] [Nat]Absence check using 551 positive place invariants in 100 ms returned sat
[2024-05-29 10:51:43] [INFO ] After 656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:51:43] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-29 10:51:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 10:51:43] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 10:51:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 363 ms
[2024-05-29 10:51:43] [INFO ] After 1060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-29 10:51:43] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 57 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 56 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2024-05-29 10:51:43] [INFO ] Invariant cache hit.
[2024-05-29 10:51:44] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-05-29 10:51:44] [INFO ] Invariant cache hit.
[2024-05-29 10:51:46] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 3238 ms to find 0 implicit places.
[2024-05-29 10:51:46] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-29 10:51:46] [INFO ] Invariant cache hit.
[2024-05-29 10:51:47] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4138 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 64 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 10:51:47] [INFO ] Invariant cache hit.
[2024-05-29 10:51:47] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:51:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2024-05-29 10:51:48] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:51:49] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2024-05-29 10:51:49] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 10:51:49] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2024-05-29 10:51:49] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-29 10:51:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 578 ms
[2024-05-29 10:51:49] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-29 10:51:49] [INFO ] After 1637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 111 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 63 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2024-05-29 10:51:49] [INFO ] Computed 551 invariants in 5 ms
[2024-05-29 10:51:50] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-05-29 10:51:50] [INFO ] Invariant cache hit.
[2024-05-29 10:51:52] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2768 ms to find 0 implicit places.
[2024-05-29 10:51:52] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 10:51:52] [INFO ] Invariant cache hit.
[2024-05-29 10:51:53] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3713 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:51:53] [INFO ] Invariant cache hit.
[2024-05-29 10:51:54] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:51:54] [INFO ] [Nat]Absence check using 551 positive place invariants in 105 ms returned sat
[2024-05-29 10:51:55] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:51:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-29 10:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-29 10:51:55] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-29 10:51:55] [INFO ] After 1260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1552 transition count 1302
Applied a total of 297 rules in 108 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Finished random walk after 5286 steps, including 1 resets, run visited all 1 properties in 95 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 146 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 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 29 reset in 1084 ms.
Product exploration explored 100000 steps with 29 reset in 1300 ms.
Built C files in :
/tmp/ltsmin4880117033377193186
[2024-05-29 10:51:58] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2024-05-29 10:51:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:51:58] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2024-05-29 10:51:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:51:58] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2024-05-29 10:51:58] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:51:58] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4880117033377193186
Running compilation step : cd /tmp/ltsmin4880117033377193186;'/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/ltsmin4880117033377193186;'/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/ltsmin4880117033377193186;'/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 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 72 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2024-05-29 10:52:01] [INFO ] Invariant cache hit.
[2024-05-29 10:52:02] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-29 10:52:02] [INFO ] Invariant cache hit.
[2024-05-29 10:52:04] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 2734 ms to find 0 implicit places.
[2024-05-29 10:52:04] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-29 10:52:04] [INFO ] Invariant cache hit.
[2024-05-29 10:52:05] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3726 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Built C files in :
/tmp/ltsmin14779301028482327629
[2024-05-29 10:52:05] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2024-05-29 10:52:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:52:05] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2024-05-29 10:52:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:52:05] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2024-05-29 10:52:05] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:52:05] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14779301028482327629
Running compilation step : cd /tmp/ltsmin14779301028482327629;'/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/ltsmin14779301028482327629;'/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/ltsmin14779301028482327629;'/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 10:52:08] [INFO ] Flatten gal took : 48 ms
[2024-05-29 10:52:08] [INFO ] Flatten gal took : 35 ms
[2024-05-29 10:52:08] [INFO ] Time to serialize gal into /tmp/LTL9542648626374237415.gal : 6 ms
[2024-05-29 10:52:08] [INFO ] Time to serialize properties into /tmp/LTL5743870711997641380.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/LTL9542648626374237415.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17702503855957262679.hoa' '-atoms' '/tmp/LTL5743870711997641380.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/LTL5743870711997641380.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17702503855957262679.hoa
Detected timeout of ITS tools.
[2024-05-29 10:52:24] [INFO ] Flatten gal took : 32 ms
[2024-05-29 10:52:24] [INFO ] Flatten gal took : 33 ms
[2024-05-29 10:52:24] [INFO ] Time to serialize gal into /tmp/LTL4707517457574400215.gal : 5 ms
[2024-05-29 10:52:24] [INFO ] Time to serialize properties into /tmp/LTL12845563380775521480.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/LTL4707517457574400215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12845563380775521480.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(("((p2546==0)||(p2570==0))")||(G("(p2918==0)"))))))
Formula 0 simplified : G(F!"(p2918==0)" & FG!"((p2546==0)||(p2570==0))")
Detected timeout of ITS tools.
[2024-05-29 10:52:39] [INFO ] Flatten gal took : 33 ms
[2024-05-29 10:52:39] [INFO ] Applying decomposition
[2024-05-29 10:52:39] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9069788743159019147.txt' '-o' '/tmp/graph9069788743159019147.bin' '-w' '/tmp/graph9069788743159019147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9069788743159019147.bin' '-l' '-1' '-v' '-w' '/tmp/graph9069788743159019147.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:52:39] [INFO ] Decomposing Gal with order
[2024-05-29 10:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:52:39] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-29 10:52:39] [INFO ] Flatten gal took : 73 ms
[2024-05-29 10:52:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 7 ms.
[2024-05-29 10:52:39] [INFO ] Time to serialize gal into /tmp/LTL13587031829715185590.gal : 9 ms
[2024-05-29 10:52:39] [INFO ] Time to serialize properties into /tmp/LTL2740762978507940874.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/LTL13587031829715185590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2740762978507940874.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i37.u410.p2546==0)||(i37.u415.p2570==0))")||(G("(i42.u472.p2918==0)"))))))
Formula 0 simplified : G(F!"(i42.u472.p2918==0)" & FG!"((i37.u410.p2546==0)||(i37.u415.p2570==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4630108796686025782
[2024-05-29 10:52:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4630108796686025782
Running compilation step : cd /tmp/ltsmin4630108796686025782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2451 ms.
Running link step : cd /tmp/ltsmin4630108796686025782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4630108796686025782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-04 finished in 99868 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 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3058 transition count 2456
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1211 place count 2449 transition count 2199
Iterating global reduction 2 with 7 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1218 place count 2449 transition count 2196
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1224 place count 2446 transition count 2196
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 2 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 3010 place count 1553 transition count 1303
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 3012 place count 1551 transition count 1301
Applied a total of 3012 rules in 650 ms. Remains 1551 /3059 variables (removed 1508) and now considering 1301/2809 (removed 1508) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2024-05-29 10:53:10] [INFO ] Computed 551 invariants in 5 ms
[2024-05-29 10:53:11] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-05-29 10:53:11] [INFO ] Invariant cache hit.
[2024-05-29 10:53:13] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
[2024-05-29 10:53:13] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-29 10:53:13] [INFO ] Invariant cache hit.
[2024-05-29 10:53:13] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3059 places, 1301/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4308 ms. Remains : 1551/3059 places, 1301/2809 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s192 0) (EQ s209 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 31 reset in 1154 ms.
Product exploration explored 100000 steps with 32 reset in 1296 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 139528 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139528 steps, saw 118201 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:53:19] [INFO ] Invariant cache hit.
[2024-05-29 10:53:20] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:53:20] [INFO ] [Nat]Absence check using 551 positive place invariants in 109 ms returned sat
[2024-05-29 10:53:21] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:53:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:53:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 10:53:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:53:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 335 ms
[2024-05-29 10:53:21] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-29 10:53:21] [INFO ] After 1457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1551 transition count 1301
Applied a total of 297 rules in 100 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59711 steps, run visited all 1 properties in 739 ms. (steps per millisecond=80 )
Probabilistic random walk after 59711 steps, saw 58776 distinct states, run finished after 741 ms. (steps per millisecond=80 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 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 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 57 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-05-29 10:53:22] [INFO ] Invariant cache hit.
[2024-05-29 10:53:23] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-29 10:53:23] [INFO ] Invariant cache hit.
[2024-05-29 10:53:25] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
[2024-05-29 10:53:25] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 10:53:25] [INFO ] Invariant cache hit.
[2024-05-29 10:53:26] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3712 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6455 steps, including 1 resets, run visited all 1 properties in 86 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32 reset in 1114 ms.
Product exploration explored 100000 steps with 32 reset in 1374 ms.
Built C files in :
/tmp/ltsmin9444998820714662840
[2024-05-29 10:53:29] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2024-05-29 10:53:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:53:29] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2024-05-29 10:53:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:53:29] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2024-05-29 10:53:29] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:53:29] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9444998820714662840
Running compilation step : cd /tmp/ltsmin9444998820714662840;'/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/ltsmin9444998820714662840;'/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/ltsmin9444998820714662840;'/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 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 60 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-05-29 10:53:33] [INFO ] Invariant cache hit.
[2024-05-29 10:53:33] [INFO ] Implicit Places using invariants in 861 ms returned []
[2024-05-29 10:53:33] [INFO ] Invariant cache hit.
[2024-05-29 10:53:35] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
[2024-05-29 10:53:35] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 10:53:35] [INFO ] Invariant cache hit.
[2024-05-29 10:53:36] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3681 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin11292484710660686822
[2024-05-29 10:53:36] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2024-05-29 10:53:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:53:36] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2024-05-29 10:53:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:53:36] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2024-05-29 10:53:36] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:53:36] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11292484710660686822
Running compilation step : cd /tmp/ltsmin11292484710660686822;'/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/ltsmin11292484710660686822;'/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/ltsmin11292484710660686822;'/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 10:53:40] [INFO ] Flatten gal took : 34 ms
[2024-05-29 10:53:40] [INFO ] Flatten gal took : 34 ms
[2024-05-29 10:53:40] [INFO ] Time to serialize gal into /tmp/LTL5737915585480927240.gal : 5 ms
[2024-05-29 10:53:40] [INFO ] Time to serialize properties into /tmp/LTL16991815184536633781.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/LTL5737915585480927240.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8615999798225672620.hoa' '-atoms' '/tmp/LTL16991815184536633781.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/LTL16991815184536633781.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8615999798225672620.hoa
Detected timeout of ITS tools.
[2024-05-29 10:53:55] [INFO ] Flatten gal took : 36 ms
[2024-05-29 10:53:55] [INFO ] Flatten gal took : 35 ms
[2024-05-29 10:53:55] [INFO ] Time to serialize gal into /tmp/LTL8290051289483830377.gal : 6 ms
[2024-05-29 10:53:55] [INFO ] Time to serialize properties into /tmp/LTL17917911919279269100.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/LTL8290051289483830377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17917911919279269100.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("((p469==0)||(p493==0))"))))
Formula 0 simplified : FG!"((p469==0)||(p493==0))"
Detected timeout of ITS tools.
[2024-05-29 10:54:10] [INFO ] Flatten gal took : 35 ms
[2024-05-29 10:54:10] [INFO ] Applying decomposition
[2024-05-29 10:54:10] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13667905939565187549.txt' '-o' '/tmp/graph13667905939565187549.bin' '-w' '/tmp/graph13667905939565187549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13667905939565187549.bin' '-l' '-1' '-v' '-w' '/tmp/graph13667905939565187549.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:54:10] [INFO ] Decomposing Gal with order
[2024-05-29 10:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:54:10] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-29 10:54:10] [INFO ] Flatten gal took : 56 ms
[2024-05-29 10:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 7 ms.
[2024-05-29 10:54:10] [INFO ] Time to serialize gal into /tmp/LTL16827139607785759526.gal : 30 ms
[2024-05-29 10:54:10] [INFO ] Time to serialize properties into /tmp/LTL14322366645115267447.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/LTL16827139607785759526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14322366645115267447.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 : !((G(F("((i6.u69.p469==0)||(i6.u74.p493==0))"))))
Formula 0 simplified : FG!"((i6.u69.p469==0)||(i6.u74.p493==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9817796926334735909
[2024-05-29 10:54:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9817796926334735909
Running compilation step : cd /tmp/ltsmin9817796926334735909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2473 ms.
Running link step : cd /tmp/ltsmin9817796926334735909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9817796926334735909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-05 finished in 91146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 3058 transition count 2459
Reduce places removed 349 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 350 rules applied. Total rules applied 699 place count 2709 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 700 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 700 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1200 place count 2458 transition count 2208
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1207 place count 2451 transition count 2201
Iterating global reduction 3 with 7 rules applied. Total rules applied 1214 place count 2451 transition count 2201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1214 place count 2451 transition count 2198
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1220 place count 2448 transition count 2198
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 2 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 3 with 1786 rules applied. Total rules applied 3006 place count 1555 transition count 1305
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 3008 place count 1553 transition count 1303
Applied a total of 3008 rules in 601 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2024-05-29 10:54:41] [INFO ] Computed 551 invariants in 4 ms
[2024-05-29 10:54:42] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-29 10:54:42] [INFO ] Invariant cache hit.
[2024-05-29 10:54:44] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
[2024-05-29 10:54:44] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 10:54:44] [INFO ] Invariant cache hit.
[2024-05-29 10:54:45] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/3059 places, 1303/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4280 ms. Remains : 1553/3059 places, 1303/2809 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NOT (AND (EQ s202 1) (EQ s204 1))) (NOT (AND (EQ s419 1) (EQ s437 1)))), p1:(AND (EQ s419 1) (EQ s437 1)), p0:(EQ s1035 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 23354 steps with 18 reset in 235 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-08 finished in 4683 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))))'
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 442 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2024-05-29 10:54:45] [INFO ] Computed 551 invariants in 15 ms
[2024-05-29 10:54:47] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2024-05-29 10:54:47] [INFO ] Invariant cache hit.
[2024-05-29 10:54:50] [INFO ] Implicit Places using invariants and state equation in 3618 ms returned []
Implicit Place search using SMT with State Equation took 4847 ms to find 0 implicit places.
[2024-05-29 10:54:50] [INFO ] Invariant cache hit.
[2024-05-29 10:54:53] [INFO ] Dead Transitions using invariants and state equation in 2366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7657 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s489 1) (EQ s521 1)), p0:(EQ s161 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-09 finished in 7825 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)||((p1 U (p2||G(p3)))&&X(X(F(p2))))))'
Support contains 7 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 437 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
[2024-05-29 10:54:53] [INFO ] Invariant cache hit.
[2024-05-29 10:54:55] [INFO ] Implicit Places using invariants in 1279 ms returned []
[2024-05-29 10:54:55] [INFO ] Invariant cache hit.
[2024-05-29 10:54:59] [INFO ] Implicit Places using invariants and state equation in 4001 ms returned []
Implicit Place search using SMT with State Equation took 5283 ms to find 0 implicit places.
[2024-05-29 10:54:59] [INFO ] Invariant cache hit.
[2024-05-29 10:55:01] [INFO ] Dead Transitions using invariants and state equation in 2350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8071 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s1218 1) (EQ s1298 1)), p3:(NEQ s199 1), p1:(AND (EQ s2884 1) (EQ s2914 1)), p0:(AND (EQ s2227 1) (EQ s2251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6926 steps with 0 reset in 87 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-10 finished in 8520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 435 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
[2024-05-29 10:55:02] [INFO ] Invariant cache hit.
[2024-05-29 10:55:03] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2024-05-29 10:55:03] [INFO ] Invariant cache hit.
[2024-05-29 10:55:07] [INFO ] Implicit Places using invariants and state equation in 3729 ms returned []
Implicit Place search using SMT with State Equation took 5153 ms to find 0 implicit places.
[2024-05-29 10:55:07] [INFO ] Invariant cache hit.
[2024-05-29 10:55:09] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7850 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-11 finished in 8015 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 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 428 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2024-05-29 10:55:10] [INFO ] Computed 551 invariants in 13 ms
[2024-05-29 10:55:11] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-29 10:55:11] [INFO ] Invariant cache hit.
[2024-05-29 10:55:15] [INFO ] Implicit Places using invariants and state equation in 3771 ms returned []
Implicit Place search using SMT with State Equation took 5086 ms to find 0 implicit places.
[2024-05-29 10:55:15] [INFO ] Invariant cache hit.
[2024-05-29 10:55:17] [INFO ] Dead Transitions using invariants and state equation in 2434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7951 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s879 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]]
Stuttering criterion allowed to conclude after 36140 steps with 5 reset in 437 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-12 finished in 8501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)&&(G(p1)||p2)&&p3)) U p4)))'
Support contains 5 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 446 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2024-05-29 10:55:18] [INFO ] Computed 551 invariants in 16 ms
[2024-05-29 10:55:20] [INFO ] Implicit Places using invariants in 1452 ms returned []
[2024-05-29 10:55:20] [INFO ] Invariant cache hit.
[2024-05-29 10:55:23] [INFO ] Implicit Places using invariants and state equation in 3636 ms returned []
Implicit Place search using SMT with State Equation took 5099 ms to find 0 implicit places.
[2024-05-29 10:55:23] [INFO ] Invariant cache hit.
[2024-05-29 10:55:26] [INFO ] Dead Transitions using invariants and state equation in 2301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7851 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p4), (NOT p4), (OR (NOT p3) (NOT p4) (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p4), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p4) p3 p2) (AND (NOT p4) p3 p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 3}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={0} source=2 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p4:(EQ s2753 1), p3:(OR (EQ s219 1) (EQ s2753 1)), p2:(EQ s219 1), p1:(AND (EQ s1348 1) (EQ s1392 1)), p0:(EQ s2353 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-13 finished in 8177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 460 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2024-05-29 10:55:27] [INFO ] Computed 551 invariants in 14 ms
[2024-05-29 10:55:28] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2024-05-29 10:55:28] [INFO ] Invariant cache hit.
[2024-05-29 10:55:32] [INFO ] Implicit Places using invariants and state equation in 3666 ms returned []
Implicit Place search using SMT with State Equation took 5047 ms to find 0 implicit places.
[2024-05-29 10:55:32] [INFO ] Invariant cache hit.
[2024-05-29 10:55:34] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7769 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (EQ s2168 1) (EQ s2170 1)), p1:(EQ s469 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 945 ms.
Product exploration explored 100000 steps with 38 reset in 1169 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2435 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=93 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 10:55:37] [INFO ] Invariant cache hit.
[2024-05-29 10:55:40] [INFO ] [Real]Absence check using 551 positive place invariants in 1135 ms returned sat
[2024-05-29 10:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:55:52] [INFO ] [Real]Absence check using state equation in 11658 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 3052 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Applied a total of 0 rules in 225 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
[2024-05-29 10:55:52] [INFO ] Invariant cache hit.
[2024-05-29 10:55:53] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-05-29 10:55:53] [INFO ] Invariant cache hit.
[2024-05-29 10:55:57] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 5091 ms to find 0 implicit places.
[2024-05-29 10:55:57] [INFO ] Invariant cache hit.
[2024-05-29 10:56:00] [INFO ] Dead Transitions using invariants and state equation in 2513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7835 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2753 steps, including 0 resets, run visited all 1 properties in 32 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 10:56:00] [INFO ] Invariant cache hit.
[2024-05-29 10:56:04] [INFO ] [Real]Absence check using 551 positive place invariants in 1152 ms returned sat
[2024-05-29 10:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:56:15] [INFO ] [Real]Absence check using state equation in 11512 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 40 reset in 905 ms.
Product exploration explored 100000 steps with 39 reset in 1043 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3052 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3052 transition count 2802
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 351 place count 3052 transition count 2803
Deduced a syphon composed of 452 places in 6 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 452 place count 3052 transition count 2803
Performed 1049 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1501 places in 3 ms
Iterating global reduction 1 with 1049 rules applied. Total rules applied 1501 place count 3052 transition count 2803
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 1 with 352 rule applications. Total rules 1853 place count 2700 transition count 2451
Deduced a syphon composed of 1149 places in 3 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 2205 place count 2700 transition count 2451
Deduced a syphon composed of 1149 places in 3 ms
Applied a total of 2205 rules in 1268 ms. Remains 2700 /3052 variables (removed 352) and now considering 2451/2802 (removed 351) transitions.
[2024-05-29 10:56:19] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2451 rows 2700 cols
[2024-05-29 10:56:19] [INFO ] Computed 551 invariants in 33 ms
[2024-05-29 10:56:21] [INFO ] Dead Transitions using invariants and state equation in 2073 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2700/3052 places, 2451/2802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3425 ms. Remains : 2700/3052 places, 2451/2802 transitions.
Built C files in :
/tmp/ltsmin5376303268870082991
[2024-05-29 10:56:21] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5376303268870082991
Running compilation step : cd /tmp/ltsmin5376303268870082991;'/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/ltsmin5376303268870082991;'/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/ltsmin5376303268870082991;'/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 3052 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Applied a total of 0 rules in 158 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2024-05-29 10:56:24] [INFO ] Computed 551 invariants in 16 ms
[2024-05-29 10:56:26] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2024-05-29 10:56:26] [INFO ] Invariant cache hit.
[2024-05-29 10:56:29] [INFO ] Implicit Places using invariants and state equation in 3654 ms returned []
Implicit Place search using SMT with State Equation took 4990 ms to find 0 implicit places.
[2024-05-29 10:56:29] [INFO ] Invariant cache hit.
[2024-05-29 10:56:32] [INFO ] Dead Transitions using invariants and state equation in 2287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7438 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Built C files in :
/tmp/ltsmin6595615985612201654
[2024-05-29 10:56:32] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6595615985612201654
Running compilation step : cd /tmp/ltsmin6595615985612201654;'/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/ltsmin6595615985612201654;'/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/ltsmin6595615985612201654;'/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 10:56:35] [INFO ] Flatten gal took : 58 ms
[2024-05-29 10:56:35] [INFO ] Flatten gal took : 57 ms
[2024-05-29 10:56:35] [INFO ] Time to serialize gal into /tmp/LTL2287583747699008085.gal : 12 ms
[2024-05-29 10:56:35] [INFO ] Time to serialize properties into /tmp/LTL12512486761203970323.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/LTL2287583747699008085.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3798375746698249737.hoa' '-atoms' '/tmp/LTL12512486761203970323.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/LTL12512486761203970323.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3798375746698249737.hoa
Detected timeout of ITS tools.
[2024-05-29 10:56:50] [INFO ] Flatten gal took : 57 ms
[2024-05-29 10:56:50] [INFO ] Flatten gal took : 59 ms
[2024-05-29 10:56:50] [INFO ] Time to serialize gal into /tmp/LTL4278043820756102819.gal : 10 ms
[2024-05-29 10:56:50] [INFO ] Time to serialize properties into /tmp/LTL6402836006914514432.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/LTL4278043820756102819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6402836006914514432.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(X(F((X("(p516==1)"))||("((p2413==1)&&(p2415==1))"))))))
Formula 0 simplified : XXG(!"((p2413==1)&&(p2415==1))" & X!"(p516==1)")
Detected timeout of ITS tools.
[2024-05-29 10:57:05] [INFO ] Flatten gal took : 60 ms
[2024-05-29 10:57:05] [INFO ] Applying decomposition
[2024-05-29 10:57:05] [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/graph5339998437172380564.txt' '-o' '/tmp/graph5339998437172380564.bin' '-w' '/tmp/graph5339998437172380564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5339998437172380564.bin' '-l' '-1' '-v' '-w' '/tmp/graph5339998437172380564.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:57:06] [INFO ] Decomposing Gal with order
[2024-05-29 10:57:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:57:06] [INFO ] Removed a total of 450 redundant transitions.
[2024-05-29 10:57:06] [INFO ] Flatten gal took : 104 ms
[2024-05-29 10:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 10:57:06] [INFO ] Time to serialize gal into /tmp/LTL9457790779280564596.gal : 86 ms
[2024-05-29 10:57:06] [INFO ] Time to serialize properties into /tmp/LTL17242191123570467791.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/LTL9457790779280564596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17242191123570467791.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(X(F((X("(i6.i1.i1.u183.p516==1)"))||("((i34.i1.i0.u851.p2413==1)&&(i34.i1.i0.u852.p2415==1))"))))))
Formula 0 simplified : XXG(!"((i34.i1.i0.u851.p2413==1)&&(i34.i1.i0.u852.p2415==1))" & X!"(i6.i1.i1.u183.p516==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1671931847753003493
[2024-05-29 10:57:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1671931847753003493
Running compilation step : cd /tmp/ltsmin1671931847753003493;'/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/ltsmin1671931847753003493;'/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/ltsmin1671931847753003493;'/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-050B-LTLFireability-14 finished in 118144 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&&F((p1||(p2&&G(p3)))))))'
Support contains 6 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 329 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2024-05-29 10:57:25] [INFO ] Computed 551 invariants in 16 ms
[2024-05-29 10:57:26] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2024-05-29 10:57:26] [INFO ] Invariant cache hit.
[2024-05-29 10:57:30] [INFO ] Implicit Places using invariants and state equation in 3788 ms returned []
Implicit Place search using SMT with State Equation took 5202 ms to find 0 implicit places.
[2024-05-29 10:57:30] [INFO ] Invariant cache hit.
[2024-05-29 10:57:32] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7735 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s830 1), p1:(AND (EQ s3017 1) (EQ s3051 1)), p2:(EQ s1646 0), p3:(AND (EQ s1404 1) (EQ s1421 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-15 finished in 8065 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)) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1||(p1 U G(p2)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-050B-LTLFireability-03
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3058 transition count 2456
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1209 place count 2451 transition count 2201
Iterating global reduction 2 with 5 rules applied. Total rules applied 1214 place count 2451 transition count 2201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1214 place count 2451 transition count 2200
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1216 place count 2450 transition count 2200
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 3004 place count 1556 transition count 1306
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 3006 place count 1554 transition count 1304
Applied a total of 3006 rules in 494 ms. Remains 1554 /3059 variables (removed 1505) and now considering 1304/2809 (removed 1505) transitions.
// Phase 1: matrix 1304 rows 1554 cols
[2024-05-29 10:57:33] [INFO ] Computed 551 invariants in 6 ms
[2024-05-29 10:57:34] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-05-29 10:57:34] [INFO ] Invariant cache hit.
[2024-05-29 10:57:36] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2629 ms to find 0 implicit places.
[2024-05-29 10:57:36] [INFO ] Invariant cache hit.
[2024-05-29 10:57:37] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1554/3059 places, 1304/2809 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3942 ms. Remains : 1554/3059 places, 1304/2809 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1045 0), p1:(EQ s1 1), p2:(EQ s306 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22309 reset in 1341 ms.
Product exploration explored 100000 steps with 22183 reset in 1541 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/1554 stabilizing places and 2/1304 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 458 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 10:57:41] [INFO ] Invariant cache hit.
[2024-05-29 10:57:41] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 10:57:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2024-05-29 10:57:42] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 922 ms
[2024-05-29 10:57:43] [INFO ] After 2233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 10:57:44] [INFO ] After 2744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1554/1554 places, 1304/1304 transitions.
Partial Free-agglomeration rule applied 325 times.
Drop transitions removed 325 transitions
Iterating global reduction 0 with 325 rules applied. Total rules applied 325 place count 1554 transition count 1304
Applied a total of 325 rules in 76 ms. Remains 1554 /1554 variables (removed 0) and now considering 1304/1304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1554/1554 places, 1304/1304 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Finished probabilistic random walk after 42672 steps, run visited all 2 properties in 971 ms. (steps per millisecond=43 )
Probabilistic random walk after 42672 steps, saw 41859 distinct states, run finished after 974 ms. (steps per millisecond=43 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND p2 p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 1067 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2024-05-29 10:57:46] [INFO ] Invariant cache hit.
[2024-05-29 10:57:48] [INFO ] [Real]Absence check using 551 positive place invariants in 430 ms returned sat
[2024-05-29 10:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:57:54] [INFO ] [Real]Absence check using state equation in 6129 ms returned sat
[2024-05-29 10:57:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:57:56] [INFO ] [Nat]Absence check using 551 positive place invariants in 465 ms returned sat
[2024-05-29 10:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:58:02] [INFO ] [Nat]Absence check using state equation in 6130 ms returned sat
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 10:58:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:58:04] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:58:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2142 ms
[2024-05-29 10:58:04] [INFO ] Computed and/alt/rep : 1301/2696/1301 causal constraints (skipped 0 transitions) in 86 ms.
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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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 10:58:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1304/1304 transitions.
Applied a total of 0 rules in 31 ms. Remains 1554 /1554 variables (removed 0) and now considering 1304/1304 (removed 0) transitions.
[2024-05-29 10:58:09] [INFO ] Invariant cache hit.
[2024-05-29 10:58:10] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-05-29 10:58:10] [INFO ] Invariant cache hit.
[2024-05-29 10:58:12] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2609 ms to find 0 implicit places.
[2024-05-29 10:58:12] [INFO ] Invariant cache hit.
[2024-05-29 10:58:13] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3442 ms. Remains : 1554/1554 places, 1304/1304 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/1554 stabilizing places and 2/1304 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 14 factoid took 444 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 10:58:14] [INFO ] Invariant cache hit.
[2024-05-29 10:58:14] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 10:58:14] [INFO ] [Nat]Absence check using 551 positive place invariants in 105 ms returned sat
[2024-05-29 10:58:15] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 10:58:15] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-29 10:58:15] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2024-05-29 10:58:15] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-29 10:58:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2024-05-29 10:58:16] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2024-05-29 10:58:16] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2024-05-29 10:58:16] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2024-05-29 10:58:16] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 0 ms to minimize.
[2024-05-29 10:58:16] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-29 10:58:16] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:58:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 964 ms
[2024-05-29 10:58:16] [INFO ] After 2312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 10:58:17] [INFO ] After 2824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1554/1554 places, 1304/1304 transitions.
Partial Free-agglomeration rule applied 325 times.
Drop transitions removed 325 transitions
Iterating global reduction 0 with 325 rules applied. Total rules applied 325 place count 1554 transition count 1304
Applied a total of 325 rules in 83 ms. Remains 1554 /1554 variables (removed 0) and now considering 1304/1304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1554/1554 places, 1304/1304 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Finished probabilistic random walk after 42672 steps, run visited all 2 properties in 997 ms. (steps per millisecond=42 )
Probabilistic random walk after 42672 steps, saw 41859 distinct states, run finished after 1000 ms. (steps per millisecond=42 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND p2 p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 1202 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2024-05-29 10:58:20] [INFO ] Invariant cache hit.
[2024-05-29 10:58:21] [INFO ] [Real]Absence check using 551 positive place invariants in 450 ms returned sat
[2024-05-29 10:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:58:27] [INFO ] [Real]Absence check using state equation in 5517 ms returned sat
[2024-05-29 10:58:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:58:28] [INFO ] [Nat]Absence check using 551 positive place invariants in 454 ms returned sat
[2024-05-29 10:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:58:34] [INFO ] [Nat]Absence check using state equation in 5958 ms returned sat
[2024-05-29 10:58:34] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 10:58:35] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 10:58:35] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-29 10:58:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:58:35] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 10:58:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 10:58:35] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-29 10:58:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2084 ms
[2024-05-29 10:58:37] [INFO ] Computed and/alt/rep : 1301/2696/1301 causal constraints (skipped 0 transitions) in 89 ms.
[2024-05-29 10:58:43] [INFO ] Deduced a trap composed of 2 places in 814 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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 10:58:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 22183 reset in 1309 ms.
Product exploration explored 100000 steps with 21950 reset in 1445 ms.
Built C files in :
/tmp/ltsmin9140331113760254307
[2024-05-29 10:58:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9140331113760254307
Running compilation step : cd /tmp/ltsmin9140331113760254307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2605 ms.
Running link step : cd /tmp/ltsmin9140331113760254307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9140331113760254307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11049106287744056244.hoa' '--buchi-type=spotba'
LTSmin run took 6776 ms.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-03 finished in 82653 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(X(X(F((p0||X(p1))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-050B-LTLFireability-14
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3058 transition count 2457
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2707 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1211 place count 2449 transition count 2199
Iterating global reduction 3 with 7 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1218 place count 2449 transition count 2196
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1224 place count 2446 transition count 2196
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 1 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 3012 place count 1552 transition count 1302
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 3014 place count 1550 transition count 1300
Applied a total of 3014 rules in 528 ms. Remains 1550 /3059 variables (removed 1509) and now considering 1300/2809 (removed 1509) transitions.
// Phase 1: matrix 1300 rows 1550 cols
[2024-05-29 10:58:56] [INFO ] Computed 551 invariants in 6 ms
[2024-05-29 10:58:57] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-29 10:58:57] [INFO ] Invariant cache hit.
[2024-05-29 10:58:59] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
[2024-05-29 10:58:59] [INFO ] Invariant cache hit.
[2024-05-29 10:59:00] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1550/3059 places, 1300/2809 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4112 ms. Remains : 1550/3059 places, 1300/2809 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (EQ s1091 1) (EQ s1093 1)), p1:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 122 reset in 949 ms.
Product exploration explored 100000 steps with 120 reset in 1159 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 759 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 10:59:02] [INFO ] Invariant cache hit.
[2024-05-29 10:59:04] [INFO ] [Real]Absence check using 551 positive place invariants in 413 ms returned sat
[2024-05-29 10:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:59:09] [INFO ] [Real]Absence check using state equation in 5179 ms returned sat
[2024-05-29 10:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:59:11] [INFO ] [Nat]Absence check using 551 positive place invariants in 426 ms returned sat
[2024-05-29 10:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:59:16] [INFO ] [Nat]Absence check using state equation in 4596 ms returned sat
[2024-05-29 10:59:16] [INFO ] Computed and/alt/rep : 1298/2493/1298 causal constraints (skipped 0 transitions) in 77 ms.
[2024-05-29 10:59:24] [INFO ] Added : 365 causal constraints over 73 iterations in 8697 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 34 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-29 10:59:24] [INFO ] Invariant cache hit.
[2024-05-29 10:59:25] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-05-29 10:59:25] [INFO ] Invariant cache hit.
[2024-05-29 10:59:27] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2024-05-29 10:59:27] [INFO ] Invariant cache hit.
[2024-05-29 10:59:28] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3627 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 822 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 10:59:29] [INFO ] Invariant cache hit.
[2024-05-29 10:59:30] [INFO ] [Real]Absence check using 551 positive place invariants in 367 ms returned sat
[2024-05-29 10:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:59:35] [INFO ] [Real]Absence check using state equation in 5042 ms returned sat
[2024-05-29 10:59:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:59:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 450 ms returned sat
[2024-05-29 10:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:59:41] [INFO ] [Nat]Absence check using state equation in 4649 ms returned sat
[2024-05-29 10:59:42] [INFO ] Computed and/alt/rep : 1298/2493/1298 causal constraints (skipped 0 transitions) in 79 ms.
[2024-05-29 10:59:51] [INFO ] Deduced a trap composed of 2 places in 857 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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 10:59:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 123 reset in 994 ms.
Product exploration explored 100000 steps with 122 reset in 1184 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 42 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-29 10:59:54] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-29 10:59:54] [INFO ] Invariant cache hit.
[2024-05-29 10:59:55] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 884 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Built C files in :
/tmp/ltsmin5054596278270792229
[2024-05-29 10:59:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5054596278270792229
Running compilation step : cd /tmp/ltsmin5054596278270792229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2644 ms.
Running link step : cd /tmp/ltsmin5054596278270792229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5054596278270792229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14015971277068964534.hoa' '--buchi-type=spotba'
LTSmin run took 5561 ms.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-14 finished in 67568 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 11:00:03] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin319782181245932599
[2024-05-29 11:00:03] [INFO ] Too many transitions (2809) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:00:03] [INFO ] Applying decomposition
[2024-05-29 11:00:03] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin319782181245932599
Running compilation step : cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' '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:00:03] [INFO ] Flatten gal took : 63 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/graph11464543384330808188.txt' '-o' '/tmp/graph11464543384330808188.bin' '-w' '/tmp/graph11464543384330808188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11464543384330808188.bin' '-l' '-1' '-v' '-w' '/tmp/graph11464543384330808188.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:00:03] [INFO ] Decomposing Gal with order
[2024-05-29 11:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:00:04] [INFO ] Removed a total of 450 redundant transitions.
[2024-05-29 11:00:04] [INFO ] Flatten gal took : 107 ms
[2024-05-29 11:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 11:00:04] [INFO ] Time to serialize gal into /tmp/LTLFireability5577534640646698088.gal : 27 ms
[2024-05-29 11:00:04] [INFO ] Time to serialize properties into /tmp/LTLFireability2208185189438433964.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/LTLFireability5577534640646698088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2208185189438433964.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 6 LTL properties
Checking formula 0 : !(((G(F("(i26.i2.i0.u642.p1815!=1)")))U("((i28.i0.i3.u690.p1951==1)&&(i28.i0.i3.u691.p1953==1))")))
Formula 0 simplified : FG!"(i26.i2.i0.u642.p1815!=1)" R !"((i28.i0.i3.u690.p1951==1)&&(i28.i0.i3.u691.p1953==1))"
Compilation finished in 6991 ms.
Running link step : cd /tmp/ltsmin319782181245932599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (LTLAPp1==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin319782181245932599;'/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' '<>(((LTLAPp3==true)&&X(((LTLAPp4==true)||((LTLAPp4==true) U []((LTLAPp5==true)))))))' '--buchi-type=spotba'
LTSmin run took 20507 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-29 11:26:05] [INFO ] Applying decomposition
[2024-05-29 11:26:06] [INFO ] Flatten gal took : 837 ms
[2024-05-29 11:26:06] [INFO ] Decomposing Gal with order
[2024-05-29 11:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:26:10] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 11:26:10] [INFO ] Flatten gal took : 1079 ms
[2024-05-29 11:26:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 389 ms.
[2024-05-29 11:26:14] [INFO ] Time to serialize gal into /tmp/LTLFireability14788718175886484154.gal : 151 ms
[2024-05-29 11:26:14] [INFO ] Time to serialize properties into /tmp/LTLFireability11623533782701002633.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14788718175886484154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11623533782701002633.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 : !(((G(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u1116.p1815!=1)")))U("((i0.i0.i0.i...349
Formula 0 simplified : FG!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u1116.p1815!=1)" R !"((i0.i0.i0.i0.i0...342
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin319782181245932599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp8==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5627812 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038536 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050B"
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-050B, 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-171683789000318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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