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.r461-smll-171701123100193.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 ViralEpidemic-PT-S02D1C1A12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123100193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19M 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 ViralEpidemic-PT-S02D1C1A12-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717211020806

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=ViralEpidemic-PT-S02D1C1A12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-01 03:03:43] [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-06-01 03:03:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:03:45] [INFO ] Load time of PNML (sax parser for PT used): 1849 ms
[2024-06-01 03:03:45] [INFO ] Transformed 32765 places.
[2024-06-01 03:03:45] [INFO ] Transformed 40955 transitions.
[2024-06-01 03:03:45] [INFO ] Found NUPN structural information;
[2024-06-01 03:03:45] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 2209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6951 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:04:13] [INFO ] Invariants computation overflowed in 20517 ms
[2024-06-01 03:04:20] [INFO ] Implicit Places using invariants in 27188 ms returned []
Implicit Place search using SMT only with invariants took 27225 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:04:36] [INFO ] Invariants computation overflowed in 16552 ms
[2024-06-01 03:04:43] [INFO ] Dead Transitions using invariants and state equation in 23414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57613 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 59 out of 32765 places after structural reductions.
[2024-06-01 03:04:46] [INFO ] Flatten gal took : 1736 ms
[2024-06-01 03:04:47] [INFO ] Flatten gal took : 1419 ms
[2024-06-01 03:04:50] [INFO ] Input system was already deterministic with 40955 transitions.
Support contains 58 out of 32765 places (down from 59) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 933 resets, run finished after 4343 ms. (steps per millisecond=2 ) properties (out of 32) seen :2
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 288 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 320 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 282 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 298 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 304 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 299 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 288 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 290 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 290 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 334 ms. (steps per millisecond=2 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 289 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 280 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 285 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 284 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 284 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 283 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 280 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 284 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 273 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 308 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 282 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 285 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 281 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 280 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 283 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 277 ms. (steps per millisecond=3 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:05:18] [INFO ] Invariants computation overflowed in 14208 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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-06-01 03:05:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 03:05:43] [INFO ] After 25249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 53 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 329 are kept as prefixes of interest. Removing 32436 places using SCC suffix rule.45 ms
Discarding 32436 places :
Also discarding 40162 output transitions
Drop transitions removed 40162 transitions
Drop transitions removed 479 transitions
Reduce isomorphic transitions removed 479 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 616 rules applied. Total rules applied 617 place count 329 transition count 177
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 754 place count 192 transition count 177
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 754 place count 192 transition count 149
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 810 place count 164 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 813 place count 161 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 816 place count 161 transition count 146
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 868 place count 135 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 869 place count 134 transition count 119
Applied a total of 869 rules in 262 ms. Remains 134 /32765 variables (removed 32631) and now considering 119/40955 (removed 40836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 134/32765 places, 119/40955 transitions.
Finished random walk after 89 steps, including 1 resets, run visited all 29 properties in 6 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6224 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:06:06] [INFO ] Invariants computation overflowed in 16076 ms
[2024-06-01 03:06:12] [INFO ] Implicit Places using invariants in 22175 ms returned []
Implicit Place search using SMT only with invariants took 22176 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:06:26] [INFO ] Invariants computation overflowed in 13909 ms
[2024-06-01 03:06:32] [INFO ] Dead Transitions using invariants and state equation in 19715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48119 ms. Remains : 32765/32765 places, 40955/40955 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 286 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s11512 0) (EQ s11519 0)) (OR (EQ s26011 0) (EQ s26016 0))), p1:(OR (EQ s26011 0) (EQ s26016 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 36510 steps with 3436 reset in 10001 ms.
Product exploration timeout after 26790 steps with 2476 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 958 resets, run finished after 3090 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 2465 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 2549 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 2439 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 47007 steps, run timeout after 30002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 47007 steps, saw 44973 distinct states, run finished after 30004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:08:01] [INFO ] Invariants computation overflowed in 16573 ms
[2024-06-01 03:08:26] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-06-01 03:08:51] [INFO ] After 12083ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-01 03:08:51] [INFO ] After 12151ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-01 03:08:51] [INFO ] After 25101ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 33 are kept as prefixes of interest. Removing 32732 places using SCC suffix rule.13 ms
Discarding 32732 places :
Also discarding 40874 output transitions
Drop transitions removed 40874 transitions
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 33 transition count 11
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 91 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 91 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 11 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 10 transition count 8
Applied a total of 96 rules in 99 ms. Remains 10 /32765 variables (removed 32755) and now considering 8/40955 (removed 40947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 10/32765 places, 8/40955 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 339 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 91 are kept as prefixes of interest. Removing 32674 places using SCC suffix rule.98 ms
Discarding 32674 places :
Also discarding 40818 output transitions
Drop transitions removed 40818 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 67 transition count 90
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 67 transition count 90
Applied a total of 47 rules in 179 ms. Remains 67 /32765 variables (removed 32698) and now considering 90/40955 (removed 40865) transitions.
// Phase 1: matrix 90 rows 67 cols
[2024-06-01 03:08:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:08:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 03:08:52] [INFO ] Invariant cache hit.
[2024-06-01 03:08:52] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [0, 2, 4, 12, 22, 31, 36, 41, 43, 45, 49, 51, 53]
Discarding 13 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 194 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/32765 places, 78/40955 transitions.
Graph (complete) has 38 edges and 54 vertex of which 42 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 32 transition count 56
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 27 place count 32 transition count 50
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 32 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 31 place count 32 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 31 transition count 45
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 31 transition count 45
Applied a total of 35 rules in 15 ms. Remains 31 /54 variables (removed 23) and now considering 45/78 (removed 33) transitions.
// Phase 1: matrix 45 rows 31 cols
[2024-06-01 03:08:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:08:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 03:08:52] [INFO ] Invariant cache hit.
[2024-06-01 03:08:52] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/32765 places, 45/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 31/32765 places, 45/40955 transitions.
Computed a total of 31 stabilizing places and 45 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 45
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Finished random walk after 48 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-00 finished in 188600 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((X((p1&&G(F(p2))))&&p0)))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5343 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:09:14] [INFO ] Invariants computation overflowed in 16280 ms
[2024-06-01 03:09:20] [INFO ] Implicit Places using invariants in 22606 ms returned []
Implicit Place search using SMT only with invariants took 22608 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:09:40] [INFO ] Invariants computation overflowed in 19169 ms
[2024-06-01 03:09:46] [INFO ] Dead Transitions using invariants and state equation in 25454 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53410 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s31492 1) (EQ s31522 1)), p1:(OR (EQ s6265 0) (EQ s6270 0)), p2:(OR (EQ s31492 0) (EQ s31522 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 8 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-01 finished in 53778 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))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 7611 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:10:10] [INFO ] Invariants computation overflowed in 16640 ms
[2024-06-01 03:10:17] [INFO ] Implicit Places using invariants in 22791 ms returned []
Implicit Place search using SMT only with invariants took 22792 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:10:33] [INFO ] Invariants computation overflowed in 16536 ms
[2024-06-01 03:10:39] [INFO ] Dead Transitions using invariants and state equation in 22643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53052 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s17693 0) (EQ s17700 0)), p0:(AND (EQ s6448 1) (EQ s6458 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][false, false, false]]
Product exploration timeout after 18440 steps with 9220 reset in 10002 ms.
Product exploration timeout after 16250 steps with 8125 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-02 finished in 84168 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(p1)||X(F(p2))||p0)))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5173 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:11:29] [INFO ] Invariants computation overflowed in 13103 ms
[2024-06-01 03:11:34] [INFO ] Implicit Places using invariants in 18852 ms returned []
Implicit Place search using SMT only with invariants took 18853 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:11:48] [INFO ] Invariants computation overflowed in 13720 ms
[2024-06-01 03:11:54] [INFO ] Dead Transitions using invariants and state equation in 19810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43838 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8916 0) (EQ s8923 0) (EQ s15727 0) (EQ s15731 0)), p1:(OR (EQ s15727 0) (EQ s15731 0)), p2:(OR (EQ s3609 0) (EQ s3619 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 18590 steps with 9295 reset in 10001 ms.
Product exploration timeout after 16730 steps with 8365 reset in 10002 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-03 finished in 234838 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)||(p0&&X(p1)))))||G(p2)))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5060 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:15:23] [INFO ] Invariants computation overflowed in 13204 ms
[2024-06-01 03:15:29] [INFO ] Implicit Places using invariants in 19222 ms returned []
Implicit Place search using SMT only with invariants took 19224 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:15:48] [INFO ] Invariants computation overflowed in 18043 ms
[2024-06-01 03:15:54] [INFO ] Dead Transitions using invariants and state equation in 24031 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48329 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 413 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(AND p2 p0), acceptance={} source=9 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 8}, { cond=(AND p2 p0), acceptance={} source=10 dest: 10}]], initial=4, aps=[p0:(OR (EQ s22463 0) (EQ s22472 0)), p1:(OR (EQ s12379 0) (EQ s12387 0)), p2:(AND (EQ s22463 1) (EQ s22472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 24770 steps with 6192 reset in 10003 ms.
Product exploration timeout after 20040 steps with 5010 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 771 ms. Reduced automaton from 11 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 931 resets, run finished after 3351 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 2457 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 2489 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 2469 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 47903 steps, run timeout after 30007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 47903 steps, saw 45825 distinct states, run finished after 30007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:17:23] [INFO ] Invariants computation overflowed in 16403 ms
[2024-06-01 03:17:48] [INFO ] After 10542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 03:17:48] [INFO ] After 10574ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-01 03:17:48] [INFO ] After 25064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 30 are kept as prefixes of interest. Removing 32735 places using SCC suffix rule.9 ms
Discarding 32735 places :
Also discarding 40883 output transitions
Drop transitions removed 40883 transitions
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 30 transition count 11
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 79 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 79 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 11 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 10 transition count 8
Applied a total of 84 rules in 59 ms. Remains 10 /32765 variables (removed 32755) and now considering 8/40955 (removed 40947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 10/32765 places, 8/40955 transitions.
Finished random walk after 86 steps, including 13 resets, run visited all 3 properties in 1 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 2076 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (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 273 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5198 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:18:11] [INFO ] Invariants computation overflowed in 14438 ms
[2024-06-01 03:18:16] [INFO ] Implicit Places using invariants in 20045 ms returned []
Implicit Place search using SMT only with invariants took 20047 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:18:34] [INFO ] Invariants computation overflowed in 17933 ms
[2024-06-01 03:18:40] [INFO ] Dead Transitions using invariants and state equation in 23743 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48993 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 953 resets, run finished after 3093 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 2356 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 2350 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 2413 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 47642 steps, run timeout after 30010 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 47642 steps, saw 45577 distinct states, run finished after 30010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:19:48] [INFO ] Invariants computation overflowed in 16408 ms
[2024-06-01 03:20:13] [INFO ] After 10048ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 03:20:13] [INFO ] After 10063ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-06-01 03:20:13] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 30 are kept as prefixes of interest. Removing 32735 places using SCC suffix rule.9 ms
Discarding 32735 places :
Also discarding 40883 output transitions
Drop transitions removed 40883 transitions
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 30 transition count 11
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 79 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 79 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 11 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 10 transition count 8
Applied a total of 84 rules in 50 ms. Remains 10 /32765 variables (removed 32755) and now considering 8/40955 (removed 40947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 10/32765 places, 8/40955 transitions.
Finished random walk after 34 steps, including 5 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), (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 269 ms :[true, (NOT p0), (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 268 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 22130 steps with 5532 reset in 10002 ms.
Product exploration timeout after 18660 steps with 4665 reset in 10005 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 84 are kept as prefixes of interest. Removing 32681 places using SCC suffix rule.32 ms
Discarding 32681 places :
Also discarding 40831 output transitions
Drop transitions removed 40831 transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 64 transition count 84
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 64 transition count 84
Applied a total of 41 rules in 101 ms. Remains 64 /32765 variables (removed 32701) and now considering 84/40955 (removed 40871) transitions.
[2024-06-01 03:20:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 64 cols
[2024-06-01 03:20:35] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:20:35] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/32765 places, 84/40955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 64/32765 places, 84/40955 transitions.
Built C files in :
/tmp/ltsmin7441215698646638147
[2024-06-01 03:20:36] [INFO ] Built C files in 835ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7441215698646638147
Running compilation step : cd /tmp/ltsmin7441215698646638147;'/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/ltsmin7441215698646638147;'/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/ltsmin7441215698646638147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5131 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:20:58] [INFO ] Invariants computation overflowed in 13749 ms
[2024-06-01 03:21:03] [INFO ] Implicit Places using invariants in 19657 ms returned []
Implicit Place search using SMT only with invariants took 19658 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:21:22] [INFO ] Invariants computation overflowed in 18837 ms
[2024-06-01 03:21:28] [INFO ] Dead Transitions using invariants and state equation in 24866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49659 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Built C files in :
/tmp/ltsmin8478890041151206851
[2024-06-01 03:21:29] [INFO ] Built C files in 437ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8478890041151206851
Running compilation step : cd /tmp/ltsmin8478890041151206851;'/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/ltsmin8478890041151206851;'/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/ltsmin8478890041151206851;'/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-06-01 03:21:35] [INFO ] Flatten gal took : 1099 ms
[2024-06-01 03:21:36] [INFO ] Flatten gal took : 1068 ms
[2024-06-01 03:21:36] [INFO ] Time to serialize gal into /tmp/LTL18217667276365350513.gal : 265 ms
[2024-06-01 03:21:36] [INFO ] Time to serialize properties into /tmp/LTL17887048786322894254.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/LTL18217667276365350513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut901934366289249947.hoa' '-atoms' '/tmp/LTL17887048786322894254.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
Detected timeout of ITS tools.
[2024-06-01 03:21:53] [INFO ] Flatten gal took : 1190 ms
[2024-06-01 03:21:54] [INFO ] Flatten gal took : 999 ms
[2024-06-01 03:21:54] [INFO ] Time to serialize gal into /tmp/LTL4058675627064003600.gal : 159 ms
[2024-06-01 03:21:54] [INFO ] Time to serialize properties into /tmp/LTL16933395697270851741.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4058675627064003600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16933395697270851741.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
Detected timeout of ITS tools.
[2024-06-01 03:22:10] [INFO ] Flatten gal took : 1063 ms
[2024-06-01 03:22:10] [INFO ] Applying decomposition
[2024-06-01 03:22:11] [INFO ] Flatten gal took : 994 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/graph16188342531025259241.txt' '-o' '/tmp/graph16188342531025259241.bin' '-w' '/tmp/graph16188342531025259241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16188342531025259241.bin' '-l' '-1' '-v' '-w' '/tmp/graph16188342531025259241.weights' '-q' '0' '-e' '0.001'
[2024-06-01 03:22:15] [INFO ] Decomposing Gal with order
[2024-06-01 03:22:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-01 03:35:42] [INFO ] Removed a total of 34166 redundant transitions.
[2024-06-01 03:35:43] [INFO ] Flatten gal took : 2588 ms
[2024-06-01 03:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 54574 labels/synchronizations in 17125 ms.
[2024-06-01 03:36:02] [INFO ] Time to serialize gal into /tmp/LTL13450690218259055477.gal : 433 ms
[2024-06-01 03:36:02] [INFO ] Time to serialize properties into /tmp/LTL8707916605086649421.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/LTL13450690218259055477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8707916605086649421.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
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin39086396310170097
[2024-06-01 03:36:18] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin39086396310170097
Running compilation step : cd /tmp/ltsmin39086396310170097;'/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/ltsmin39086396310170097;'/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/ltsmin39086396310170097;'/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 ViralEpidemic-PT-S02D1C1A12-LTLFireability-04 finished in 1275358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 5 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 10439 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:36:48] [INFO ] Invariants computation overflowed in 17071 ms
[2024-06-01 03:36:54] [INFO ] Implicit Places using invariants in 23054 ms returned []
Implicit Place search using SMT only with invariants took 23055 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:37:11] [INFO ] Invariants computation overflowed in 17260 ms
[2024-06-01 03:37:18] [INFO ] Dead Transitions using invariants and state equation in 23548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57046 ms. Remains : 32765/32765 places, 40955/40955 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 : ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s13533 1), p0:(OR (NEQ s17048 1) (NEQ s17053 1) (AND (EQ s27973 1) (EQ s27977 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 17620 steps with 8810 reset in 10003 ms.
Product exploration timeout after 15300 steps with 7650 reset in 10004 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) 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))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-05 finished in 88815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 82 are kept as prefixes of interest. Removing 32683 places using SCC suffix rule.18 ms
Discarding 32683 places :
Also discarding 40829 output transitions
Drop transitions removed 40829 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 60 transition count 83
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 60 transition count 83
Applied a total of 43 rules in 61 ms. Remains 60 /32765 variables (removed 32705) and now considering 83/40955 (removed 40872) transitions.
// Phase 1: matrix 83 rows 60 cols
[2024-06-01 03:37:49] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:37:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 03:37:49] [INFO ] Invariant cache hit.
[2024-06-01 03:37:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [0, 4, 6, 10, 16, 30, 38, 40, 42, 48]
Discarding 10 places :
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Implicit Place search using SMT with State Equation took 96 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/32765 places, 74/40955 transitions.
Graph (complete) has 33 edges and 50 vertex of which 41 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 33 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 33 transition count 53
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 33 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 23 place count 33 transition count 49
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 31 transition count 49
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 31 transition count 49
Applied a total of 28 rules in 7 ms. Remains 31 /50 variables (removed 19) and now considering 49/74 (removed 25) transitions.
// Phase 1: matrix 49 rows 31 cols
[2024-06-01 03:37:50] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:37:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 03:37:50] [INFO ] Invariant cache hit.
[2024-06-01 03:37:50] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/32765 places, 49/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 31/32765 places, 49/40955 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s30 1)), p1:(AND (EQ s12 1) (EQ s15 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]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-06 finished in 361 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 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5516 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:38:10] [INFO ] Invariants computation overflowed in 14760 ms
[2024-06-01 03:38:16] [INFO ] Implicit Places using invariants in 21056 ms returned []
Implicit Place search using SMT only with invariants took 21057 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:38:32] [INFO ] Invariants computation overflowed in 16128 ms
[2024-06-01 03:38:38] [INFO ] Dead Transitions using invariants and state equation in 21932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48507 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11676 1) (EQ s11681 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 9 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-09 finished in 48678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 86 are kept as prefixes of interest. Removing 32679 places using SCC suffix rule.17 ms
Discarding 32679 places :
Also discarding 40823 output transitions
Drop transitions removed 40823 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 63 transition count 87
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 63 transition count 87
Applied a total of 45 rules in 55 ms. Remains 63 /32765 variables (removed 32702) and now considering 87/40955 (removed 40868) transitions.
// Phase 1: matrix 87 rows 63 cols
[2024-06-01 03:38:38] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:38:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 03:38:39] [INFO ] Invariant cache hit.
[2024-06-01 03:38:39] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [0, 2, 4, 6, 14, 18, 30, 42, 46, 48, 50]
Discarding 11 places :
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 103 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/32765 places, 77/40955 transitions.
Graph (complete) has 35 edges and 52 vertex of which 42 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 32 transition count 57
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 27 place count 32 transition count 51
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 32 transition count 49
Applied a total of 29 rules in 5 ms. Remains 32 /52 variables (removed 20) and now considering 49/77 (removed 28) transitions.
// Phase 1: matrix 49 rows 32 cols
[2024-06-01 03:38:39] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:38:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 03:38:39] [INFO ] Invariant cache hit.
[2024-06-01 03:38:39] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/32765 places, 49/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 32/32765 places, 49/40955 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s30 1)), p1:(OR (EQ s11 0) (EQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-10 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0))||X(F(p2))))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5484 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:38:58] [INFO ] Invariants computation overflowed in 13774 ms
[2024-06-01 03:39:04] [INFO ] Implicit Places using invariants in 19899 ms returned []
Implicit Place search using SMT only with invariants took 19900 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:39:18] [INFO ] Invariants computation overflowed in 13792 ms
[2024-06-01 03:39:24] [INFO ] Dead Transitions using invariants and state equation in 19811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45197 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s32417 1) (EQ s32420 1)), p1:(AND (EQ s29109 1) (EQ s29121 1)), p2:(OR (EQ s13099 0) (EQ s13480 0))], 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 timeout after 17620 steps with 8810 reset in 10005 ms.
Product exploration timeout after 15770 steps with 7885 reset in 10002 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 1561 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-11 finished in 78516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p0))))))'
Support contains 3 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 88 are kept as prefixes of interest. Removing 32677 places using SCC suffix rule.27 ms
Discarding 32677 places :
Also discarding 40821 output transitions
Drop transitions removed 40821 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 64 transition count 87
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 64 transition count 87
Applied a total of 47 rules in 79 ms. Remains 64 /32765 variables (removed 32701) and now considering 87/40955 (removed 40868) transitions.
// Phase 1: matrix 87 rows 64 cols
[2024-06-01 03:39:57] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:39:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 03:39:57] [INFO ] Invariant cache hit.
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [0, 2, 4, 14, 20, 22, 28, 33, 35, 37, 39, 41, 60, 62]
Discarding 14 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT with State Equation took 186 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/32765 places, 73/40955 transitions.
Graph (complete) has 37 edges and 50 vertex of which 37 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 26 transition count 48
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 29 place count 26 transition count 42
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 26 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 32 place count 26 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 25 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 25 transition count 38
Applied a total of 35 rules in 9 ms. Remains 25 /50 variables (removed 25) and now considering 38/73 (removed 35) transitions.
// Phase 1: matrix 38 rows 25 cols
[2024-06-01 03:39:58] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 03:39:58] [INFO ] Invariant cache hit.
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/32765 places, 38/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 356 ms. Remains : 25/32765 places, 38/40955 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s16 1), p1:(OR (NEQ s20 1) (NEQ s22 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-12 finished in 580 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(X(X(G((G(!X(F(p0))) U p1))))))'
Support contains 3 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 83 are kept as prefixes of interest. Removing 32682 places using SCC suffix rule.24 ms
Discarding 32682 places :
Also discarding 40826 output transitions
Drop transitions removed 40826 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 60 transition count 84
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 60 transition count 84
Graph (complete) has 34 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 59 transition count 83
Applied a total of 46 rules in 84 ms. Remains 59 /32765 variables (removed 32706) and now considering 83/40955 (removed 40872) transitions.
// Phase 1: matrix 83 rows 59 cols
[2024-06-01 03:39:58] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 03:39:58] [INFO ] Invariant cache hit.
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [0, 4, 10, 22, 26, 28, 38, 44, 52, 54, 56]
Discarding 11 places :
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 177 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/32765 places, 72/40955 transitions.
Graph (complete) has 33 edges and 48 vertex of which 38 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 30 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 30 transition count 50
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 30 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 23 place count 30 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 29 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 29 transition count 47
Applied a total of 26 rules in 5 ms. Remains 29 /48 variables (removed 19) and now considering 47/72 (removed 25) transitions.
// Phase 1: matrix 47 rows 29 cols
[2024-06-01 03:39:58] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 03:39:58] [INFO ] Invariant cache hit.
[2024-06-01 03:39:58] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/32765 places, 47/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 29/32765 places, 47/40955 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s10 1)), p0:(EQ s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-13 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1&&G(p0)))||(p2 U p1)))'
Support contains 5 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 78 are kept as prefixes of interest. Removing 32687 places using SCC suffix rule.24 ms
Discarding 32687 places :
Also discarding 40833 output transitions
Drop transitions removed 40833 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 57 transition count 81
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 57 transition count 81
Applied a total of 41 rules in 86 ms. Remains 57 /32765 variables (removed 32708) and now considering 81/40955 (removed 40874) transitions.
// Phase 1: matrix 81 rows 57 cols
[2024-06-01 03:39:59] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:39:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 03:39:59] [INFO ] Invariant cache hit.
[2024-06-01 03:39:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [2, 4, 8, 12, 18, 20, 22, 32, 36]
Discarding 9 places :
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Implicit Place search using SMT with State Equation took 166 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/32765 places, 73/40955 transitions.
Graph (complete) has 32 edges and 48 vertex of which 41 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 34 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 33 transition count 58
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 33 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 33 transition count 54
Applied a total of 23 rules in 9 ms. Remains 33 /48 variables (removed 15) and now considering 54/73 (removed 19) transitions.
// Phase 1: matrix 54 rows 33 cols
[2024-06-01 03:39:59] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:39:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 03:39:59] [INFO ] Invariant cache hit.
[2024-06-01 03:39:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/32765 places, 54/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 348 ms. Remains : 33/32765 places, 54/40955 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s29 1) (EQ s32 1)), p1:(EQ s11 1), p2:(AND (EQ s24 1) (EQ s27 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, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-14 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5038 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:40:18] [INFO ] Invariants computation overflowed in 14201 ms
[2024-06-01 03:40:24] [INFO ] Implicit Places using invariants in 20278 ms returned []
Implicit Place search using SMT only with invariants took 20279 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:40:38] [INFO ] Invariants computation overflowed in 13975 ms
[2024-06-01 03:40:45] [INFO ] Dead Transitions using invariants and state equation in 20192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45512 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s3831 0) (EQ s3835 0)), p1:(AND (EQ s28142 1) (EQ s28146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLFireability-15 finished in 45768 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)||(p0&&X(p1)))))||G(p2)))'
[2024-06-01 03:40:46] [INFO ] Flatten gal took : 1222 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin422900425902602432
[2024-06-01 03:40:47] [INFO ] Too many transitions (40955) to apply POR reductions. Disabling POR matrices.
[2024-06-01 03:40:47] [INFO ] Built C files in 309ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin422900425902602432
Running compilation step : cd /tmp/ltsmin422900425902602432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-06-01 03:40:47] [INFO ] Applying decomposition
[2024-06-01 03:40:49] [INFO ] Flatten gal took : 1264 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/graph9001560444059446888.txt' '-o' '/tmp/graph9001560444059446888.bin' '-w' '/tmp/graph9001560444059446888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9001560444059446888.bin' '-l' '-1' '-v' '-w' '/tmp/graph9001560444059446888.weights' '-q' '0' '-e' '0.001'
[2024-06-01 03:40:51] [INFO ] Decomposing Gal with order
[2024-06-01 03:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin422900425902602432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin422900425902602432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 720 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-06-01 03:57:09] [INFO ] Removed a total of 34166 redundant transitions.
[2024-06-01 03:57:10] [INFO ] Flatten gal took : 2326 ms
[2024-06-01 03:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 56182 labels/synchronizations in 9843 ms.
[2024-06-01 03:57:21] [INFO ] Time to serialize gal into /tmp/LTLFireability9256684887927754999.gal : 299 ms
[2024-06-01 03:57:21] [INFO ] Time to serialize properties into /tmp/LTLFireability16789316589521275326.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/LTLFireability9256684887927754999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16789316589521275326.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X((G("((u14961.cFactor12112221211221==0)||(i11369.u14957.patient1122212112212==0))"))||(("((u14961.cFactor12112221211221==0)||(i...377
Formula 0 simplified : XX(F!"((u14961.cFactor12112221211221==0)||(i11369.u14957.patient1122212112212==0))" & (!"((u14961.cFactor12112221211221==0)||(i11369...363
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 6402536 kB
After kill :
MemTotal: 16393228 kB
MemFree: 9575164 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="ViralEpidemic-PT-S02D1C1A12"
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 ViralEpidemic-PT-S02D1C1A12, 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 r461-smll-171701123100193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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